Author: Charles Roberson
Date: 18:38:54 02/15/04
Go up one level in this thread
Good luck on developing your engine. It is a long road full of bumps.
A quick look may not see all the bugs. Also, you do not supply code Gen_Moves
and so forth. Suggestion -- change Gen_Moves to return an integer branch
factor. this will simplify the for loop.
But the likely bug is ByRef b As cMove_t. it should be by value.
scenario: any move other than the last move to try is the best move.
Thus the last move is searched but b is not updated at the root level.
Therefore the value of b (since it is by reference) is at the deepest ply
of the tree. Thus you get a black move at odd plys from the root position.
Charles
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.