Author: Paul
Date: 09:27:26 01/19/01
Go up one level in this thread
On January 18, 2001 at 22:06:37, leonid wrote: >Position is exact and response 10 moves must be or shortest possible, or very >close move. Actually my program solved this position through selective search in >11 moves. Solution was instant. Finding shortest mate is the other story. >Through brute force program said in 8 mate is not there. Only 9 still could be >looked. > >I found that branching factor was terrible to see 9 moves. AMD 400Mhz. > >8 moves - 2h 44 min. >7 moves - 2 min 48 sec. >6 moves - 7 sec. > >Leonid. If you found the solution instantly, that's pretty fast!! ;) Mine took 27 seconds on a P2 400MHz, and that's with special extension settings. But I remember that your move ordering is a little different from what most of 'us' do. You look at checking moves first, right? Anyway, it's quite impressive, Leonid! Groetjes ... Paul
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.