Author: Angrim
Date: 13:21:30 08/28/01
Go up one level in this thread
On August 28, 2001 at 05:39:13, leonid wrote: >[D]6kq/rqqrqqqq/n2Q4/b1PNRBBN/b2Q3N/p2Q3K/n2P2Q1/q1Q2RR1 w - - > >Please indicate your result. > >Thanks, >Leonid. Athlon 1.2ghz, pn^2 without pn-transpositions: proved that move f5xh7 wins, 11 turns PN2:1146353 evals, 31056 expands, 3.91 seconds Athlon 1.2ghz, pn^2 with pn-transpositions: proved that move f5xh7 wins, 11 turns PN2:952464 evals, 22224 expands, 3.36 seconds Athlon 1.2ghz, pn-search with transpositions: proved that move f5xh7 wins, 11 turns PN:261248 evals, 6348 expands, 24 max ply, 0.95 seconds pn-transpositions meaning that the search checks for transpositions in the secondary pn-search as well as in the primary pn2 search. I just recently implemented this for use in my suicide chess program, but it seems to also pay off for standard chess. This costs a bit of speed(nps) but seems to be well worth it. Also clearly raw pn-search is much(3x) better than pn^2 search, but only if you have enough ram(pn-search is best-first search so all nodes must be stored in ram) 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.