Hello:
I have just found that Perft(29) of 8×8 checkers was computed some months ago (
On-Line Encyclopedia of Integer Sequences link) by the author of Nemesis programme (the champion of the Computer Checkers World Championship of 2002:
summary of the championship). It would be good to get independent verification. Anyway, the number given is the next one:
Code: Select all
Perft(29) = 76,309,690,522,352,444,005
So, Perft(29) ~ 7.63e+19. Not an easy, short task at all!
Just waiting until the verification...
Code: Select all
List of prime numbers:
https://oeis.org/A000040
https://oeis.org/A000040/a000040.txt
Perft(29) = 76,309,690,522,352,444,005 = 5 × 59 × 577 × 4093 × 150767 × 726497
Perft(29) = 76,309,690,522,352,444,005 = p(3) × p(17) × p(106) × p(564) × p(13911) × p(58525)
Regards from Spain.
Ajedrecista.