Try all possible piece placements at (x, y) (including 'filling' it with
empty space), and for each one, recursively try to fill the next spot in
the box.
Can this configuration be solved by making some sequence of moves?
If so, and the minimum-length solution is longer than the longest found so
far, print it out.