Author: Artem Pyatakov
Date: 14:51:01 07/26/01
I was looking at the source codes of Gerbil and Crafty and noticed that they handle the following problem differently: as part of the iterate/think loops both programs try to force their program to search the PV nodes from the previous iteration first, which makes sense, but the implementation of this is very different. Gerbil just saves the PV into a separate array, while Crafty saves the PV into the hash table. Now for my questions: 1) What are the advantages/disadvantages of each of these implementations? 2) I don't understand how Gerbil solves the following problem, because from what I see it only checks if the current move is equal to the PV move: what if the current move matches the PV move AT THIS PLY, but what if the moves in the PLIES BEFORE are different? 3) I don't understand how HashStorePV works - the code is kind of confusing for a bitboards neophite like myself. In particular: what depth is it inserting the moves as? With what score? Thank you in advance for answering/clarifying these. Artem Pyatakov
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.