Author: Angrim
Date: 12:25:20 07/21/01
Go up one level in this thread
On July 21, 2001 at 12:35:35, Gian-Carlo Pascutto wrote: >On July 21, 2001 at 04:39:07, leonid wrote: > >>Hi! >> >>Probably next position will be easy for every program. >> >>[D]knqb2Rq/qbq2Qq1/nq2Nr2/q2QQQ2/2NQQ3/1QrQ4/Rq4BB/q5QK w - - >> >>Please indicate your result. >> >>Thanks, >>Leonid. > >2.5 seconds > >Sjeng: prove > >Max time to search (s): 200000 > >P: 0 D: 100000000 N: 186965 S: 186964 Mem: 7.85M Iters: 2132 MaxDepth: 29 >Time : 2.500000 >This position is WON. >PV: e6c7 a6c7 d5b7 b6b7 d4a7 a5a7 e4b7 c8b7 g2b7 > > >-- >GCP PN^2 on a 650mhz Athlon. proved that move e6xc7 wins, 12 turns PN2:726849 evals, 14938 expands, 3.81 seconds I assume that sjeng is useing pn^2 for this, so would expect some similarity. not quite sure what your N value is, I assume that "Iters" is the number of times that the search backtracked a value to the root node? Angrim
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.