Author: Dieter Buerssner
Date: 07:33:43 11/13/01
Go up one level in this thread
On November 13, 2001 at 04:22:02, Uri Blass wrote: >I believe that yace with the existing tablebases can find the right move in >almost every KPPP vs KPPP endgame by search in a short time. Uri, thanks for your confidence. However I fear, this is unfortunately not true. When all pawns are unblocked, and on different files, the branching factor of Yace is not very good. When the position is blocked, however large search depth can be reached very fast. BTW. a very difficult position posted some time ago here by Peter McKenzie: [D] 2k2K2/8/pp6/2p5/2P5/PP6/8/8 w - - a4 wins. Regards, Dieter
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.