Author: Steve Maughan
Date: 11:45:01 05/07/99
Go up one level in this thread
On May 07, 1999 at 13:50:29, James Robertson wrote: >> >>PS What I mean my incremental move generation is that by moving a piece from A >>to B some moves are added to the move stack and others are removed. The >>alternative is to create the move stack at each node. > >This does not make sense. I understand adding moves to the move stack (every >program must do this, and there is no alternative), but removing moves will >destroy the search. > >James Yes I didn't explain that too well! If there is an incremental move and threat generation then to generate the moves at a given node one would simply zip through all the moves in the stack storing them as candidate moves for the node. There is no need to check for their legality hence this part of the program is fast. The slow bit is maintaining the list of moves. Regards Steve Maughan
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.