Problem 1263 · Hard

Minimum Moves to Move a Box to Their Target Location

Search over (box, player) states with 0-1 BFS: walking costs nothing and each push costs one.

Open the interactive visualisation