Thanks!
I wrote a program that solves endgame positions in the game of checkers. It starts out with 1 piece against 1 piece (like king vs. king or king vs. checker) and it will "build" onto this, eventually solving every one of nearly 1 billion positions up to and including 3 checkers vs. 3 checkers.
It is a 64-bit application, so it will run most expediently on 64-bit hardware.
It turns out, due to the nature of the code, it makes for an excellent benchmarking utility. You can read more about it here:
http://www.liquidnitrogenoverclocking.com/benchmark_results.shtml
and here
http://www.liquidnitrogenoverclocking.com/benchmark_about.shtml
I am interested in building a "clone" of the system that solves the endgames the fastest to extend my work on solving checkers databases. Right now, the 10-piece database set contains 8.5 trillion positions, and it takes about 4.2 computer years to solve. So, overclocked systems can cut down on this time significantly, which really has me interested!
I am not looking to "steal anyone's secrets" and I am not looking to become a "challenger" to anyone's scores on here. I would just like to find really tough endgames to solve, like this one, which takes a (surprising) 253 moves before red can win:
Thanks again!