Author: Robert Hyatt
Date: 15:15:45 12/09/01
Go up one level in this thread
On December 09, 2001 at 17:55:43, Pham Minh Tri wrote: >On December 09, 2001 at 10:37:30, Robert Hyatt wrote: > >>On December 09, 2001 at 06:21:37, Pham Minh Tri wrote: >> >>>Someone told me that he used hashtable for bishops, but I do not understand how >>>to do (unlike pawns, I found there was too little information to save for >>>hashtable). Could someone explain to me or show me where to download the source >>>code. Many thanks in advance. >> >> >>You could, in theory, use special purpose hash tables for any evaluation >>component that is costly to compute. The danger is that this can become >>very memory-intensive... > >Yes, but how? :) Just compute a hash signature based only on the locations of bishops. And use that to index a hash table that only has bishop scores in it...
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.