Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: EGTB: Better algorithm

Author: Tony Werten

Date: 10:07:50 04/08/01

Go up one level in this thread


On April 08, 2001 at 12:34:23, Urban Koistinen wrote:

>On April 08, 2001 at 09:57:35, Tony Werten wrote:
>
>>On April 08, 2001 at 08:41:19, Uri Blass wrote:
>>>Here is an example of position in t4
>>
>>Why is this an example of t4 ? Might be t100, white has just captured a queen.
>
>Yes, it is in t100 too.
>t(2n+2) = or(t(2n),t(2n+2))
>Both the even and the odd sets are growing. (bits get set but never reset as n
>increase)
>
>>Or t99, black has taken the other white queen.
>
>No. Black is to move, that is what the 'b' means.

Black took a queen then white checks would bring it in t99.

Tony

>
>>Counting the number of moves for the 50 move rule has nothing to do with
>>distance to mate. ( Or I really don't get it )
>>
>>BTW with pawns on the board, t100 and t99 will almost be the only tables with
>>any information.
>
>They are the ones with the information needed by endgames that convert to the
>current. They are also the ones needed by a chess program to decide if a
>position is a win for white with a single small i/o operation.
>They don't tell you distance to conversion. (it is <50 moves)
>
>Urban Koistinen



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.