This blog has moved to Medium

Subscribe via email


«
»

Checkers Solved

20/7/07, 19:40
1 Star2 Stars3 Stars4 Stars5 Stars (No Ratings Yet)
Loading ... Loading ...

I always said the game is not interesting, compared to chess and Go.

This Slashdot post confirms it – someone solved Checkers (שש בש), by creating a big ass database containing all possible positions…

Tags: ,

7 Comments

  1. Ido:

    Checkers isn’t “shesh-besh”, mate. It’s Damka

    20/7/07, 21:05

  2. ripper234:

    You’re right of course, this is the result of writing a post in 5 seconds without thinking 🙂

    Now that I think about it, I doubt Shesh-Besh (Backgammon) could actualy be solved so easily – it’s randomized, which adds another dimension of complexity to it all. It’s still a sucky game though, and I enjoy Checkers more as it’s less dependant on luck.

    I know some players adhere to the view that backgammon is a game of skill, but to me it always looked like an ars game.

    20/7/07, 21:29

  3. Eli:

    While backgammon can’t be “solved” because of its probabilistic nature, programs play it way better than humans for a long time now. IIRC, the guy who wrote the program used Neural Nets to study games and infer strategy.

    21/7/07, 12:01

  4. ripper234:

    I don’t agree. Even probabilistic games (as long as they’re Perfect Information) can have an optimal strategy.

    One could theoretically construct a database with all possible backgammon games and deduce the chances of winning from every position – and so come with the best strategy. I think the problem is this database would be extremely large.

    Games that may not have a winning strategy are those with some hidden information – Prisoner’s Dilemma and Poker come to mind.

    21/7/07, 12:09

  5. ripper234:

    On a partially related subject, see an example of
    a perfect information deterministic game with no winning strategy     (that is, if you believe
    the Axiom of Choise).

    21/7/07, 12:17

  6. eli:

    Optimal strategy – yes.
    Solution – no.

    What is usually implied by solution is a strategy that *guarantees* some result. An optimal strategy in a probabilistic game can perhaps guarantee an average result over many games, but not a result in a single game.

    21/7/07, 18:51

  7. ripper234:

    Well I guess it depends on the definition. I would define a game as “solved” if the solution gives the optimal strategy at any given game state. On probabilistic games this does not guarantee victory, but it does guarantee the best chance of victory.

    21/7/07, 18:58