Author: F. Huber
Date: 13:15:22 01/05/05
Go up one level in this thread
On January 05, 2005 at 14:02:58, Richard Pijl wrote: >On January 05, 2005 at 13:47:09, Kurt Utzinger wrote: > >>Much too easy for any chess program I think. Or can you find >>a modern engine being unable to solve this within 0 to some seconds? >>Kurt > >I only tried a few, and all were able to solve it in 1 second or less on my >machine. >Now a question for the mate-solvers: Is this a mate in 20, or can a faster mate >be found? >Richard. Hi Richard, I´ve tried it now in brute-force mode with ´Gustav 3.0´ up to depth 13, but with a branching factor of about 2.5 it would take too long, if it´s really a mate in 20 (so at least it´s above 13). Chest (also in brute force) is much slower for this position ... Of course all this is _without_ any EGTBs, since both programs don´t support them - although: Heiner Marxens private development version of Chest seems to already have implemented it, so maybe Heiner could try this problem. Regards, Franz.
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.