Author: Paul Byrne
Date: 21:43:04 03/08/02
Go up one level in this thread
On March 08, 2002 at 15:58:18, Angrim wrote: >On March 08, 2002 at 09:22:58, Ed Schröder wrote: > >>[d]4r3/p1p1pPp1/P1P1P1P1/5K2/3p2P1/7p/3P1ppr/3R1nkq w - - id M19; >> >>I came across this beauty, mate in 19 moves. Rebel has no clue. >> >>Ed > >too complex for regular pn-search, pn^2 search proves the win >in 99 seconds. >hardware: Athlon 1.2ghz >proved that move f7xe8n wins, 18.5 turns >PN2:42345930 evals, 3827760 expands, 99.18 seconds > >Almost all of the time was spent searching the winning move, >Rb1 was the only other move that was searched for more than >one pn2 node. > >Angrim Guildenstern's PN search found this in 44.3 seconds... (also Athlon 1.2 GHz) i=1563432 n=11725648 p=0 d=1000000000 t=44.343 What is interesting is that my PN^2 search finds it faster than the regular PN: i=605 n=4659/10523188 p=0/49 d=1000000000/1000000000 t=40.27 -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.