[Kriztoffer]

Originally Posted by LiquidNitrogen

Actually, it solves checkers endgames, up to 6 pieces, and nearly 1 billion positions in total. It is a 64-bit move generator, so this code tends to exercise the CPU very well. It also does a mini-tree search (computationally intense) and it allocates a large block of RAM (842 MB) and accesses the memory constantly. It does not move and reallocate the RAM, it does "seek" addresses within the block, read from it, and write to it.

It's a great way to test if there are "bit errors" in your overclocking setup. If there are, you get very weird results in the "report.txt" file that gets printed out as a result.

This is the fastest result so far:

http://www.**************************.com/report.txt

Cool! I'm running it right now, but on XP 32 bit:O