Author: Uri Blass
Date: 03:59:16 12/28/02
Go up one level in this thread
On December 28, 2002 at 06:44:47, David Rasmussen wrote: >On December 27, 2002 at 18:12:09, Heiner Marxen wrote: > >>On December 27, 2002 at 17:48:52, David Rasmussen wrote: >> >>>[D]b2r2kr/p1pqb1p1/1p5p/4p3/2P1N1P1/1P2Q3/P3P2P/4KRR1 b - - 0 1 >>> >>>Is this a forced mate? Well, of course it is, it's at least a forced mate in 500 >>>I should think, but is there a forced mate that a program can find in any >>>reasonable time (< a week) or that a human with the aid of a computer could >>>find? >>> >>>/David >> >>You mean, black mates white? >>According to Chest not within 8 moves. >>I've started another run with depth=10. We'll see. >> >>If you have some line you think to be the best, I could try to prove >>from there. >> > >It was just game I played as black against a friend. There is no doubt that >black is winning, but I couldn't help feel that there was a forced mate in a >reasonable number of moves (say, less than 20) and with a small solution tree. >I guess I was wrong :) > >/David It seemed that you were right. Dieter proved mate in 18 with yace and the size of the solution tree is not the reason that programs cannot solve it in a short time(otherwise yace with learning from going forward and backward could not solve it) 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.