Author: Russell Reagan
Date: 07:43:07 01/03/03
Go up one level in this thread
I also tried computing perft differently, but it gives the same values...
unsigned int perft2 (int n) {
generateLegalMoves();
unsigned int nmoves = 0;
for (move_t * move = firstMove; move != lastMove; ++move) {
makeMove(move);
if (n > 1) nmoves += perft(n-1);
else ++nmoves;
undoMove();
}
return nmoves;
}
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.