Dear All,
This was a favorite pass time on my handymobile. Its pushing blocks also known as Sokoban:
![]()
Some years ago it came as a little surprise to me that it is NP complete. Here is one paper saying that:
Demain, E.D. and Hoffmann, M.
Pushing Blocks is NP-Complete for Noncrossing Solution Paths, 2001
http://www.inf.ethz.ch/~hoffmann/pub/dh-pbnns-01.pdf
Best Regards

