The Strongest Sokoban Solver

(healeycodes.com)

33 points | by ibobev 3 days ago

6 comments

  • ZiiS 0 minutes ago
    One of the clearest write-ups showing how coding agents can be applied to good engineering and help with comprehension.
  • vintermann 49 minutes ago
    Decades ago I built a Sokoban solver, then a more generic puzzle solver which could handle a wide range of similar games (such as Atomix). It's fun to see someone else finding all of these heuristics. Excluding dead squares and searching backwards to meet in the middle I definitively implemented, and I thought of many of these others too (though whether I got around to implementing them is another question!). This post is praiseworthy for showing how intuitive these tricks are once you know them.
  • quibono 22 minutes ago
    FWIW there's a proof of Sokoban being NP-complete in a Cambridge University student publication called Eureka [0], edition 54.

    So, quite a lot more complex than one might think.

    [0] https://archim.org.uk/publications/

    • mjdv 4 minutes ago
      In fact it's even PSPACE-complete, which is (probably) much, much harder!
  • xpct 43 minutes ago
    > Just to be ultra clear here, as you may be skim reading...

    This caught me completely off-guard, and I was indeed skim reading. Nonetheless, very well written article!

  • skrebbel 38 minutes ago
    Wow this is an excellent writeup! Hats off.
  • asibahi 1 hour ago
    This is an interesting read ive been playing Jon Blow's latest game.

    Maybe i will apply some of these heuristics myself when solving puzzles.