Quote:
|
Originally Posted by twistedmosaic
Checkers is far more finite. You have half of the squares to consider, and at any given time, you have a dozen or so legal moves (never more than 24). That's why good checker players go out 30 (or whatever) moves, and chess players go out 10...after 10 moves in chess, the amount of legal board configurations after 10 turns is probably more than checkers after 30.
Finally, wasn't checkers 'solved' not to long ago?
Edit: yep:
http://www.sciencemag.org/cgi/content/abstract/1144079 |
see, thats part of the problem - no human can ever master chess or checkers, so it doesn't really matter if it is more "finite" to a computer or not, unless of course your using a computer to play the game for you!
to a human, or the people who will actually be playing the game of checkers for the purpose of enjoying themselves, whether competitively or casually, it is every bit as difficult to play as chess... - as I said previously, there have been chess masters who could not master checkers and vice versa...
as far as checkers being solved, as said in the quote, "solved" only means determining the final result in a game with no mistakes made by either player; or also, perfect play by both sides leads to a draw
in order words, something checker players have already known for over a century now... I already knew that if I were playing against another master checker player and neither of us made a mistake, the game would be a draw, computers have merely proven it
same can be said for chess, if 2 players make no mistakes, the game will be a draw, but it will take a while for computers to gain the technology to "prove" this already known fact