Perft(20) = Node Count Plus (20)

Discussion about development of draughts in the time of computer and Internet.
Post Reply
Posts: 62
Joined: Mon Apr 20, 2009 01:10

Perft(20) = Node Count Plus (20)

Post by 64_bit_checkers_engine » Sun Feb 20, 2011 23:36

I decided to run Perft(20) using my Node Count Plus program.

This was a non-parallel version of perft(), with no hash table. It was run on a single core.


It took 16.5 days averaging 52.5 million nodes per second. I think it is safe to say, this is the limit of perft() for checkers on a single core with no additional enhancements.

I would be interested in learning more about parallelizing perft(), and also implementing a hash table for it. I'm not sure how to go about either at the moment.

The good news is: all of the divide() numbers agree with Aart Bik's postings on his page here:

I also have capture and crown data for my runs, and await confirmation from other programmers for this also.

Code: Select all

TOTAL NODES  = 74545030871553
TOTAL JUMPS  = 12980932483933
TOTAL CROWNS = 2680251548251
TOTAL TIME   = 1419377.5390 seconds
TOTAL SPEED  = 52519522.6945 nodes/second.

Post Reply