5 ms·

http://xkcd.com/832/ http://xkcd.com/832/ Randall Munroe could do a "small" update to this based on these rules... although it would take some time.

by Kurtz79 13y ago

lucb1e 13y ago
A "small" update? I think this is more like the difference between checkers and chess. But yes, relevant xkcd
- tripzilch 13y ago
  > I think this is more like the difference between checkers and chess I'm not sure what you mean by this? BTW are you aware that despite it has only one type of stone and simpler rules, checkers is in fact the more complex game, to write an AI for?
  - lucb1e 13y ago
    I don't know why you're downvoted for asking a question, but what I meant is this: The person I replied to said the admin of XKCD could do a "small" update to his post about tic tac toe. I remarked that this is not a small update, and used checkers and chess as an analogy. Chess is much more complex and harder to learn than checkers, and as you remarked, chess is indeed harder to write an effective AI for. Just like the difference between tic tac toe and ultimate tic tac toe ;) Edit: I meant chess is harder to write an AI for of course, not checkers. Fixed.
  - shawabawa3 13y ago
    > checkers is in fact the more complex game, to write an AI for? I'm almost certain that's false. Checkers is weakly solved (There are AI's that will never lose, only win or draw) I assume you meant Go, not checkers. And that's mainly harder for AI because the board is 5 times bigger.
  - saalweachter 13y ago
    Checkers has been solved. Both players can draw with perfect play. The usual caveat with checkers is that you are probably not good at it. Even if it is simpler and smaller than chess, being a good chess player gives you no advantage and the game is still sufficiently complex that you can't quickly brute force it without years of practice. A chess master will get their ass handed to them by a skilled yokel.
  - pong_ 13y ago
    I guess you refer to International checkers (being from the Netherlands). Still a challenge for computers, given that the brute-force solution for American checkers doesn't work well for this larger board. Much harder to program an AI for than chess, certainly. The computer never managed to beat the world champion in a match last year.
    - tripzilch 13y ago
      Cool, I didn't know there were multiple versions of checkers. I'll have to check (hah) out that solution for the American version though, always interesting (as well as what the differences in rules are). Off to Wikipedia, I guess ;-)

http://xkcd.com/832/ http://xkcd.com/832/ Randall Munroe could do a "small" update to this based on these rules... although it would take some time.

by Kurtz79 13y ago

http://xkcd.com/832/ http://xkcd.com/832/ Randall Munroe could do a "small" update to this based on these rules... although it would take some time.

lucb1e 13y ago

A "small" update? I think this is more like the difference between checkers and chess. But yes, relevant xkcd

tripzilch 13y ago
> I think this is more like the difference between checkers and chess I'm not sure what you mean by this? BTW are you aware that despite it has only one type of stone and simpler rules, checkers is in fact the more complex game, to write an AI for?
- lucb1e 13y ago
  I don't know why you're downvoted for asking a question, but what I meant is this: The person I replied to said the admin of XKCD could do a "small" update to his post about tic tac toe. I remarked that this is not a small update, and used checkers and chess as an analogy. Chess is much more complex and harder to learn than checkers, and as you remarked, chess is indeed harder to write an effective AI for. Just like the difference between tic tac toe and ultimate tic tac toe ;) Edit: I meant chess is harder to write an AI for of course, not checkers. Fixed.
- shawabawa3 13y ago
  > checkers is in fact the more complex game, to write an AI for? I'm almost certain that's false. Checkers is weakly solved (There are AI's that will never lose, only win or draw) I assume you meant Go, not checkers. And that's mainly harder for AI because the board is 5 times bigger.
- saalweachter 13y ago
  Checkers has been solved. Both players can draw with perfect play. The usual caveat with checkers is that you are probably not good at it. Even if it is simpler and smaller than chess, being a good chess player gives you no advantage and the game is still sufficiently complex that you can't quickly brute force it without years of practice. A chess master will get their ass handed to them by a skilled yokel.
- pong_ 13y ago
  I guess you refer to International checkers (being from the Netherlands). Still a challenge for computers, given that the brute-force solution for American checkers doesn't work well for this larger board. Much harder to program an AI for than chess, certainly. The computer never managed to beat the world champion in a match last year.
  - tripzilch 13y ago
    Cool, I didn't know there were multiple versions of checkers. I'll have to check (hah) out that solution for the American version though, always interesting (as well as what the differences in rules are). Off to Wikipedia, I guess ;-)