Author: José de Jesús García Ruvalcaba
Date: 14:06:14 01/23/00
Go up one level in this thread
On January 23, 2000 at 11:45:29, Steve Coladonato wrote: >On January 21, 2000 at 15:47:20, José de Jesús García Ruvalcaba wrote: > >>On January 21, 2000 at 08:34:23, Steve Coladonato wrote: >> >>> >>>Dave, >>> >>>One last question then. Given that the tablebase position is a mate in 15, how >>>do you know that the one ply search is choosing the correct move? >>> >>>Steve >> >> The tablebases are probed after the one ply search, i.e. after every legal move >>a tablebase probe is done. Then the tablebases return the score for each one, >>the the highest scoring one is chosen. >>José. > >Jose, > >From this and Michel's response, is it not true then that the "best move" is >stored in the tablebases and if so why have the program run thru the legal moves >and probe the tablebases for each one? If you're concerned about legal moves, >pick the best move as noted in the tablebase and then check to see if it's legal >(in case of some error in the tablebase). I realize the CPU time here is >minimal and I'm just trying to get the logic behind the use of tablebases. > >Thanks again. > >Steve Tablebases do not store moves (not even the "best" move). They only store scores for positions. (Assuming the root position is in tablebases and that there are no tablebases missing) the program has to search all the legal ply-one moves, and probe for every resulting position. This returns a score for each one, and the highest scoring one is chosen. José.
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.