Author: Uri Blass
Date: 12:44:57 07/29/01
Go up one level in this thread
On July 29, 2001 at 15:29:36, Heiner Marxen wrote: >On July 27, 2001 at 21:01:50, Heiner Marxen wrote: > >>On July 27, 2001 at 19:44:05, Uri Blass wrote: >> >>>On July 27, 2001 at 19:39:35, Uri Blass wrote: >>> >>>>On July 27, 2001 at 10:53:28, leonid wrote: >>>> >>>>>Hi! >>>>> >>>>>If you are ready, you can solve this problem: >>>>> >>>>>[D]1N1k1N1B/q1q1q1q1/1rRbRr2/Q1nBn1Q1/1Q3Q2/n1Q1Q1n1/1Q1Q1Q2/n2K2nb w - - >>>>> >>>>>Please indicate your result... even if your program fail. >>>>> >>>>>Thanks, >>>>>Leonid. >>>> >>>>chesmaster6000(PIII850 ss=10) >>>>solution Rexd6+ >>>>3:56 mate in 11 >>>>5:47 mate in 10 >>> >>>and after 10:49 Rxc7 is mate in 9 >>> >>>Uri >> >>Chest has "problems" with this problem: to find "no mate in 7" needed already >>103 minutes. With an effective branching factor of 15+ the next depth will >>need more than a full day. :-( >>If there is no mate in 8 it is out of reach for Chest. >> >>To be continued... :-) >> >>Heiner <snipped> >Ha! According to Chest this is a mate in 8 :-) I understand that there is only one solution Am I right? Note that I did not give chessmaster more than 15 minutes so I am not going to be surprised if chessmaster6000 can solve it faster. I expect chessmaster to solve it faster if it is not a null move problem and I do not believe that it can be a null move problem with so many pieces on the board but I am not going to give chessmaster many hours to calculate this position. 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.