Author: Andrew Williams
Date: 08:49:46 01/24/99
Go up one level in this thread
On January 24, 1999 at 11:11:55, Hugh Cumper wrote: >This may be very simple matter to the old pros. When I first wrote a chess >program I created a stack of boards for lookahead and copied the current board >each time I wanted to look further ahead, discarding it again to go back up. I >suppose I did that because I started writing programs for games like Kalah where >the board is small and moves are relatively epensive to take back. Recently I >have seen programs the have one board and store unmake move information in >addition to move information so the move can be retracted. I am trying to think >which is more efficient but I can't decide. Has anyone worked this out >theoretically or practically? This depends on the architecture of the machine. But on a PC, because of the limited memory bandwidth, it's better to update the few parts of the board that change rather than copy the whole thing every time. If you're using a big mainframe it might be better to copy. Andrew Williams
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.