Author: Sylvain Renard
Date: 07:56:30 03/30/99
Go up one level in this thread
On March 30, 1999 at 08:38:23, James T. Walker wrote:
>
>Hello Sylvain,
>I don't think the missing tablebase should matter ! If your tablebase would
>simply tell your program to promote to a Rook from that point on it is a won
>game and no tablebases are needed.
It should not but it does! The conception of the Thompson databases
is different from Edward's tablebases. You find the following information
(see readme in Thompson CD's)in these databases : BLACK TO MOVE (the weaker
side) and lose in some number of move. So, if you have the stronger side,
you HAVE TO MOVE first, and then check for the value of the position.
The advantage of this method is to avoid having 2 files : one for
white to move and another one for black to move. One file is enough,
the space needed is divided by 2. Of course you spend more time reading
the database.
After 1.f7 Rf2 you have to play 2.f7=R to know what happens after this
move. But after this move, you are not in Pr_r.g anymore, the program
MUST read Rr_r.g to have the correct information. The value of this
position (white to move and win with f7=R) is NOT included in
the Pr_r.g file! That's why Fritz cannot find the good move without
the Rr_r.g file.
Best regards,
Sylvain
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.