Author: Michel Langeveld
Date: 08:43:54 06/15/99
Go up one level in this thread
On June 15, 1999 at 04:30:58, Andreas Stabel wrote: >I have made the following table. The first 7 plys are checked against >crafty. Ply 8 needed 47 hours on a 500MHz Pentium III. I have started to >calculate ply 9, but it will take approximately three months, so I don't >know if I will be able to finish it. Luckily my program is restartable. > >Ply| Number of nodes | Total # nodes | # Nodes / Prev. # Nodes >---+-----------------+---------------+------------------------ >0 | 1 | 1 | term= 0, ill=0 >1 | 20 | 21 | 20.000 term= 0, ill=0 >2 | 400 | 421 | 20.000 term= 0, ill=0 >3 | 8902 | 9323 | 22.255 term= 0, ill=0 >4 | 197281 | 206604 | 22.161 term= 0, ill=461 >5 | 4865609 | 5072213 | 24.663 term= 8, ill=15375 >6 | 119060324 | 124132537 | 24.470 term= 355, ill=916789 >7 | 3195901860 | 3320034397 | 26.843 term= 11183, ill=27695459 >8 | 84998978956 | 88319013353 | 26.596 term= 446950, ill=1165178140 > >term = The number of endnodes occuring before the calulated ply caused by a >mate or stalemate. ill is the number of illegal moves the program had to >undo because the king would be in check. > >Note that some report these numbers with term added to the number of nodes. > >Regards >Andreas Stabel Thank you very much for the results. We seem to have the same results. I shall also calculate a full 9 ply. 9 ply is interesting because it's the first time 0-0-0(white) can happen and promotions(white) are valid. I shall try also to get results of ply 10. But I don't know if this is doable in a reasonable time. Kind regards, Michel Langeveld (rudolf@stad.dsl.nl)
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.