Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Question: The best implementation option

Author: Russell Reagan

Date: 10:03:13 05/19/03

Go up one level in this thread


On May 19, 2003 at 11:24:57, Fermin Serrano wrote:

>Hello
>I started to modify TSCP program and I have learn a lot from it, but same time
>ago I decided to develop my own engine and during this process I have a few
>questions: What's the best option of these?:
>a) Make the move over a board and undo the move over the same board or
>b) Make a copy of the board, make the move over the copy and searching from this
>copy and no undo to return , else take the original board.
>
>I intuit second one could be very low, becuase the copy would take 64 iterations
>over a loop (* same boards, one for the piezes, color, attacks arrays, etc).
>isn't it?
>
>P.S.: when I say "best" I think in terms of speed

I use choice 'a'. I think it is the best choice usually, unless you are using a
super-computer that has vector instructions. Most people use 'a' I think.



This page took 0 seconds to execute

Last modified: Thu, 15 Apr 21 08:11:13 -0700

Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.