let me know?
I don’t know of one, but the idea is interesting.
It might not be practical because of speed. Most chess algorithms
are very search-intensive.
Now, one thing I’ve thought about but will never have the time to
implement – make it a distributed application (with drb) so that
the work can be split among different machines.
Now that would be interesting. And if you throw enough boxes
at it, you eliminate the speed issue. You could in theory produce
a distributed chess app in Ruby that was “as fast” as a non-
distributed one in C.
Thanks for the links. Unfortunately the ruby quizzes were for
two-player chess, but I’m hoping to find some code that would let me
play against the computer. Being new to chess I’m not looking for Deep
Blue quality, just something that works reasonably well (maybe up to a
900 chess rating, not 2500).
Uh oh… I’m getting the feeling as I write this that I might have
ventured into the waters of “he who suggested it should do it.”
It would also be a good way to compare the speed of 1.8.2 vs. 2.0
(whenever 2.0 comes out).