Author: Reinhard Scharnagl
Date: 16:30:52 06/15/05
Go up one level in this thread
As I already have mentioned sometimes, I have made good experiences when developing Smirf in providing a Perft version, which uses caching of position related data (partial sums) in a transposition table. This is not done to speed up Perft (which of course would be the case) but to compare the results of traditional Perft with the cached one. Problems with the hash code stability and integrity and collisions could be detected and also localized by approaching to the causing move / situation. Reinhard.
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.