Author: Uri Blass
Date: 08:43:28 11/13/01
Go up one level in this thread
On November 13, 2001 at 10:33:43, Dieter Buerssner wrote: >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. It depends on the definition of almost We can try to generate 1000 random legal KPPP vs KPPP endgames and find in how many cases programs can find the right move. The only possible problem is that in some of these positions humans may also not know the right move. Uri
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.