Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: TB's Basic Question

Author: Robert Hyatt

Date: 21:22:07 01/21/00

Go up one level in this thread


On January 21, 2000 at 08:34:23, Steve Coladonato wrote:

<snip>

>
>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


Easy.  All the TBs have are mate-in-n, mated-in-n, or draw scores, for every
possible position for all the pieces.  ALl you have to do is generate the
ply-1 move list, make each one, and probe the TB for the exact score after
that move.  Take the move that leads to the best score.  Which will be the
shortest mate if winning, the longest mate if losing, or any move that draws
if all the moves lead to draw or loss.

Think of it as a "perfect" evaluation function for positions with 5 or fewer
total pieces on the board..



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.