8 Easy Pieces

Apply your OR skills, in particular branch and bound and dynamic programming, to solve the famous Eight Easy Pieces puzzle.

  • Step 1: Shuffle the tiles
  • Step 2: Move the tiles (by clicking)

The objective is to restore the tiles to their original position as quickly as possible.


This problem provides an excellent framework for illustrating potential cooperation between branch and bound and dynamic rogramming.



Contributed by Moshe Sniedovich