Author: Richard Pijl
Date: 02:23:02 12/06/02
Go up one level in this thread
On December 05, 2002 at 11:40:34, Dieter Buerssner wrote: >On December 05, 2002 at 07:51:02, Gian-Carlo Pascutto wrote: > >>Some programs have a workaround that makes the ugliest >>appearances of this problem go away. > >Can you give an example, preferably from a real game, where known workarounds >would not make the problem go away? > >In the discussed case, probably even using the normal search time instead of >exiting search early after a mate score woulh have helped. > >>But that doesn't >>fix the problem - it still occurs everywhere else in the >>search tree. > >I don't understand this. Why should there be any problem in the search tree? >Until a "critical" situation is at the root, what should be the problem? > Tablebases might force a program in a position it doesn't know how to win, for example because the position is an exception to general rules. These positions are possibly avoided by the chessknowledge of the program, but lured into it because it sees a forced mate from the table bases. It might even sac material because of it. Richard
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.