Author: Tord Romstad
Date: 13:40:36 03/03/06
Go up one level in this thread
On March 03, 2006 at 16:19:00, Mark Boylan wrote: >On March 03, 2006 at 15:24:26, Steve Maughan wrote: > >> >>1) Use a hash code based system i.e. 'good' positions are stored as their hash >>table > > >Would this mean that every program would need to use the same hash values? Not really. It would be sufficient to compute a special "book hash key" before looking up the board position in the book. Because it wouldn't be necessary to update this key during the search, the cost would be almost zero (the time needed to compute the book hash key would be just a tiny fraction of the time needed to search for this key in the book file, anyway). Tord
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.