Thread
:
Computer Scientists Solve Checkers
View Single Post
Reply
Posted 2007-07-21, 03:34 PM in reply to
Demosthenes
's post starting
"I doubt the code is all that complex...."
mjordan2nd said:
I doubt the code is all that complex. My guess is once they work out every position there really doesn't need to be any heuristics, all they need is a shortest path algorithm from the current position to mate.
This doesn't work because the program has to change its approach as the player does. If you just have shortest-path then it'd be easy to draw against.
Il papa caca nei legno?
Profile
PM
WWW
Search
RoboticSilence