Author: F. Huber
Date: 00:21:47 06/26/04
Go up one level in this thread
On June 25, 2004 at 18:08:37, Dann Corbit wrote: > >It should be noted that Popeye is very sensitive to search depth. >This simple M4 problem: >2kr1b1r/1pp1qp1p/3p2p1/1P1Pp3/2Q1P1n1/R4N2/1PP2PPP/5RK1 w - - bm Qc6; >will cause it to groan on for a long time if default search depth is left to 10. > >If you set it down to M5 it solves it in 23 seconds. >If you set it to M4: >solution finished. Time = 7.735 s > >Possible solution: >iterate from 1 to N to solve. It should be noted that reading my short description ´PopeyeUCI.txt´ could also be strongly recommended. ;-) "... ´SearchDepth´ should always be set to the correct value, otherwise Popeye would eventually not find the shortest mate (or it would take an extremly long time). ..." 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.