Author: K. Burcham
Date: 08:15:33 11/18/01
Go up one level in this thread
On November 18, 2001 at 10:34:12, Uri Blass wrote: >On November 18, 2001 at 10:14:09, Rafael Andrist wrote: > >>On November 18, 2001 at 10:03:15, piet de hoop wrote: >> >>>The next position occured in Diep versus Rebel Century 4 round 6 of the Dutch >>>Open Computer Chess 2001 >>> >>>[D] 8/6p1/3k3p/8/3K4/7P/8/8 b - - 0 43 >>> >>>The result was a draw, but for some computerprograms I tried, the evaluation was >>>from -1 to -3.4 pawn. (Fritz 6.0, Crafty,Yace) >>> >>>I expect that programs equipped with the right pawntable base have no problem >>>with this position, but i expected that programs without these tablebase while >>>calculating over 30 plys or more should give the right evalution? >>> >>>Or do i miss something? >>> >> >>If the program doesn't know it is a draw, then Black won't give his extra pawn >>away in the search. To recognize a draw by 50 move rule, several hundreds of >>plys are necessary. > >I think that it is possible to prove a draw by repetition in less plies. >I did not check it but my intuition tells me that the black king has not too >many squares to defend the pawns so it seems that less than 100 plies are needed >for a repetition or losing a pawn for black even after considering the fact that >the black pawns may go forward every few plies to avoid repetition. > >Uri shredder5 shows depth of 4/8 for draw in 0 time on its clock with tablebases. Engine: Shredder 5 4.00 0:00 +0.01 1...g5 2.h4 (26) 0.3 best move: g7-g5 time: 0:00.074 min n/s: 471 nodes: 33 TB: 53 below shredder5 shows same. i cleared position learning, cleared hash. deleted path to tablebases. not sure why it shows same eval. tablebases with 0 pieces found! [Cache: 10 MB + internal 0.00 MB] endgame databases: 0 4.00 0:00 +0.01 1...g5 2.h4 (26) best move: g7-g5 time: 0:00.005 minnodes: 33 kburcham
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.