Author: Richard Bean
Date: 01:54:06 01/26/04
Go up one level in this thread
> 1 20 - - - > 2 400 20.00 - - > 3 5,362 13.41 0.28 KB 0.43 > 4 72,078 13.44 4.34 KB 0.49 > 5 822,518 11.41 77.72 KB 0.77 > 6 9,417,681 11.45 0.95 MB 0.85 > 7 96,400,068 10.24 14.04 MB 1.22 > 8 988,187,354 10.25 154.59 MB 1.32 > 9 9,183,421,888 9.29 1.77 GB 1.66 > >"branch" is just the effective branching factor from ply-to-ply. >"size" is the size of the file containing the positions (which can then be used > to compute the next ply). >"bits" is the number of bits/position in the file. Congratulations, please add it to http://www.research.att.com/projects/OEIS?Anum=A083276 What is bits/position, were you using some sort of Huffman coding? It shouldn't take too long to verify Albert Bertilsson's distributed computation of perft(11) with these positions.
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.