Author: Michel Langeveld
Date: 11:43:51 06/23/99
Go up one level in this thread
On June 23, 1999 at 01:23:41, Eran wrote: >On June 22, 1999 at 15:25:35, Michel Langeveld wrote: > >>On June 22, 1999 at 12:29:00, Eran wrote: >> >>>On June 22, 1999 at 12:11:54, Michel Langeveld wrote: >>> >>>>Hello Chess World!! >>>> >>>>the complete table becomes: >>>> >>[snip] >> >>>>Ply(9) Nodes= 2439530234167 = 28,70x ply(8) >>>> >>>>Ply 9 is interesting because white-promotions and white long castling is added >>>>for the first time. >>>> >>>>Volunteers for doing ply 10 or verify ply 9 :-P ? Maybe we can calculate this >>>>distributedly... >>>> >>>>Kind regards, >>>> >>>>Michel Langeveld >>> >>>What computer and what software did it? >>> >>>Eran >> >>I used a Pentium II - 350 which I overclocked to a 466 Mhz with >>external bus of 133Mhz. > >Okay. Please answer us. What software did you use? > >Eran I don't understand exactly what you want to know. But I used my own written program in C++ with Microsoft Visual Studio 6.0. I tried to write the fastest nodecounter I could. It's still far from finished, but it's quite fast already. I used an 100Mb hashtable with a 64bit key and a 22bit index. I did put a counter in the hashrecord. Also a major speed up is that the moves on the lowest ply of the tree are not executed but just counted. If you have more questions feel free to ask. Michel Langeveld
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.