Author: Ricardo Gibert
Date: 15:45:49 08/03/99
Go up one level in this thread
On August 03, 1999 at 17:21:38, KarinsDad wrote: >On August 03, 1999 at 16:46:23, Ricardo Gibert wrote: > >[snip] >> >>Correcto! I consider it more likely that Bruce and Bob misunderstand the topic, >>than Nalimov writing the program the way they suggest. >> > >There is also the possibility that the tablebases are purposely set up without >win preserving information and it is up to the program to realize problems such >as move by rep and 50 move rule. Therefore, it is up to the program to try >alternative moves. For example, to avoid 50 move rule, search captures and/or >pawn pushes within the tablebase. The tablebases are just a tool. How that tool >is used is up to each program. > >KarinsDad :) Yes, this is workable, but how could it be better? There can be a lot of leaf nodes that could hit the EGTB and the extra time spent taking care of the 50 move rule could be better spent some where else. Some of the EGTB hits will return mate in over 50. The program has to go further down the line to make sure a pawn move or capture takes place before 50 moves are played. For example: mate in 110 will require the program to find more than one pawn move or capture. Why bother when you don't have to?
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.