Author: Gian-Carlo Pascutto
Date: 05:10:09 04/06/02
Go up one level in this thread
On April 06, 2002 at 03:48:28, TEERAPONG TOVIRAT wrote: >3) >Some programs have an evaluation hashtable to store the score from >evaluation(). I think we already have transposition table for this job. >And nowaday, we can provide plenty of entries.The chance of collision in >transposition table is not so significant. So,why? >? Evaluation caches simply make my program slower. Total loss for me. As for Heinz's pruning: Think about what will happen if the material balance and the positional score are always (say 2 pawns) different, for example because of a material imbalance (pieces vs pawns). If you correct for this, is there still a gain? -- GCP
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.