2 comments

  • gcanyon3 hours ago
    Since the author seems interested in the maximum number of moves required to solve the puzzle, a similar puzzle called Subway Shuffle far outdoes Rush Hour. For example, puzzle 100 involves 9 pieces on a 10-spot grid, but requires (as far as is known, maybe the solution isn&#x27;t optimal?) 589 steps to solve. <a href="https:&#x2F;&#x2F;www.cs.brandeis.edu&#x2F;~storer&#x2F;JimPuzzles&#x2F;ZPAGES&#x2F;zzzSubwayShuffle.html" rel="nofollow">https:&#x2F;&#x2F;www.cs.brandeis.edu&#x2F;~storer&#x2F;JimPuzzles&#x2F;ZPAGES&#x2F;zzzSub...</a>
  • mzl1 hour ago
    Fun article.<p>The Rush Hour puzzle is quite fun when viewed as a planning problem. In standard PDDL the model becomes very messy. I like the extensions proposed in <a href="https:&#x2F;&#x2F;arxiv.org&#x2F;abs&#x2F;2412.06312v1" rel="nofollow">https:&#x2F;&#x2F;arxiv.org&#x2F;abs&#x2F;2412.06312v1</a> that makes the model intuitive.