Author: Sergei S. Markoff
Date: 09:42:15 02/02/03
Go up one level in this thread
Hello Robert! >>Is it proven? > >Yes. The game of chess is a graph, not a tree, which means the pathways are >interlinked in odd ways. But the 50 move rule and repetition rules are >written with the idea of a tree, because of the tranposition table. The only >way to fix it is to include the "graph information" which is the complete path >from the starting position to the position being stored... OK, we can't find the exact solution. But may be we can found non-exact solution. For example hash can't save all positions during search, but it works well. >I'm not sure what you would do to "not accept some hash probes." It means that some probes we can not accept totally. We can use best move, but research the subtree again. Sincerelly yours, Sergei
This page took 0.01 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.