Problem 1263 · Hard
Search over (box, player) states with 0-1 BFS: walking costs nothing and each push costs one.
Open the interactive visualisation