Author: blass uri
Date: 04:20:21 10/10/98
Go up one level in this thread
On October 10, 1998 at 06:50:37, blass uri wrote: >I think that you can compress distance to conversion to distance in number of >mistakes >The idea is that often the computer can find the right move by evaluation >function and if it is the case then you do not need the tablebases. > >You have to save for a position only the maximal number of times that you will >need the tablebases in the future >If you can decrease this number by 2 plies search then it is a proof that the >evaluation function cannot help and you use the tables. >If you cannot decrease this number by 2 plies search then you can use the >evaluation function to play the right move. > >The problem with this idea is that I do not see how to compress it more by >division by 2 . This idea does not work because if you save only the number of mistakes you do not know if to go from conversion in 40 with 10 mistakes to conversion in 39 with 9 mistakes or to conversion in 45 with 9 mistakes. Uri
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.