Author: Dieter Buerssner
Date: 15:12:26 12/26/03
Go up one level in this thread
On December 26, 2003 at 17:44:36, Tord Romstad wrote: >The same problem occurs, of course, in all cases when you do some search >decision >which depends on the path leading to the position. I'd really like to know how >other >programmers handle this problem. At the moment, it is my single most difficult >problem in chess programming. I agree fully with your description of the problem. I cannot think of a good solution, besides ignoring it. In the case of extensions, this might cost one ply now and then, when you see a tactical problem later. Related is the problem with repetitions (and 50 moves rule), which are also not handled correctly by the HT. Regards, Dieter
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.