Author: Gian-Carlo Pascutto
Date: 09:02:25 08/13/01
Go up one level in this thread
On August 13, 2001 at 11:53:23, leonid wrote: >Hi! > >This position is easy: > >[D]B2N1qr1/B2Qb2q/Q2Rq3/Q2Q1q2/Q2Q2q1/Q2Q3n/R2Qq2k/1KN2rq1 w - - > Sjeng: prove Max time to search (s): 2000000 P: 0 D: 100000000 N: 925481 S: 925480 Mem: 38.83M Iters: 10534 MaxDepth: 23 Time : 10.820000 This position is WON. PV: d4g1 f1g1 a7g1 h2g1 d5h1 g1f2 d2e1 >[D]B2B1qr1/N2Qb2q/Q2Rq3/Q2Q1q2/Q2q2q1/Q2Q3n/R2Qq2k/1KN2rq1 w - - Not found by proofnumbersearch before RAM was up. (Didn't try pn^2) -- GCP
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.