Author: David Rasmussen
Date: 09:29:08 12/27/00
Go up one level in this thread
On December 27, 2000 at 10:29:34, Gian-Carlo Pascutto wrote: >On December 27, 2000 at 09:43:05, Vincent Diepeveen wrote: > >> >>[D]5n2/B3K3/2p2Np1/4k3/7P/3bN1P1/2Prn1P1/1q6 w - - 0 1 mate in 30 >> >>Diep needs 10k nodes and 0 seconds to find it. >> >>How about the programs you have over there, do they need the same amount >>of nodes? > >Sjeng: prove > >Max time to search (s): 120 > >P: 0 D: 100000000 N: 27717 S: 27716 Mem: 0.85M Iters: 758 >This position is WON. >PV: e3g4 e5f5 g4h6 f5e5 h6f7 e5f5 f7d6 f5e5 f6g4 e5d5 g4e3 d5e5 d6f7 e5e4 f7g5 >e4e5 g5f3 e5e4 f3d2 e4e5 d2f3 e5e4 f3g5 e4e5 g5f7 e5e4 f7d6 e4e5 e3g4 e5d5 g4f6 >d5e5 d6f7 e5f5 f7h6 f5e5 h6g4 e5f5 g4e3 f5e5 f6g4 e5e4 g4f2 e4e5 f2d3 e5e4 d3f2 >e4e5 f2g4 e5e4 g4f6 e4e5 e3c4 e5f5 c4d6 f5e5 f6g4 e5d5 c2c4 > >The 27K nodes is tricky as most of them aren't really searched. This >takes less than a second on my Cyrix120. > >-- >GCP How on earth can you guys find this so fast?
This page took 0.01 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.