Author: Andreas Rueckert
Date: 23:40:46 04/15/03
Go up one level in this thread
On April 15, 2003 at 10:13:07, Vincent Diepeveen wrote: --<snip>-- >it is trivial that incremental generation is fastest. you just pick 1 piece and >generate all moves for it. if first move generates cutoff then you had a cheap >cutoff. That's not what I do. I always generate the moves for _all_ the pieces, do a presort, and then run alpha-beta-cutoff. I couldn't do the presort with the concept you mentioned. What I actually meant in my posting, was a move generator, that takes the moves from the position before the last move was made, then takes this last move into consideration, and if it doesn't interfere with the moves for the current piece, simply reuses the moves from the position before the last move. Ciao, Andreas
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.