Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Evaluation-based Reductions and/or Extensions

Author: Joel

Date: 19:01:13 12/28/03

Go up one level in this thread


Hello,

If it makes you feel any better, I don't know of any solution to the problem
either! :)

This goes nicely with the wacky stuff that happens when a draw score is returned
in the search, or null move craziness etc.

I just dip my head in the sand, and run some test games.

As far as I can tell, if you have path-related stuff which is triggered, then
you cannot really expect to avoid hashing errors since (at least in my program)
the hashtable does not store path information. This is assuming of course you
use the hash table in the standard fashion.

Perhaps the solution is implement the same effective kind of concept, without
making it path dependent -> don't ask me how you can do that though, it seems
like it is heavily path dependent.

Joel



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.