Author: Pham Minh Tri
Date: 15:56:05 12/09/01
Go up one level in this thread
On December 09, 2001 at 18:04:59, Matthias Gemuh wrote: >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? :) > > >Score batteries, pins, discovered checks, good/bad bishops, pairs, etc. :). Thanks, I undertand more. But could you explain more about pins and discovered checks? I think those factors concerns to many other pieces, not only bishops, so how to separate, compute and store them in hashtalbe? An other question: I know the mobility of bishop is expensive to compute, but I don't know how to save it in hashtable. Could anyone shed more light on this? Thanks.
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.