Find the adjacent tiles
Name every tile that can slide into the blank, then finish the board. A diagonal neighbour does not count.
PRACTICE COLLECTION
Four studies in legal moves and their immediate effects. Make a prediction, test it, and compare the starting-position answer.
Print these four studies with answers
These are teaching groups, not a player-tested difficulty ladder. The four board IDs match the technique examples, individual study pages and print pack.
Name every tile that can slide into the blank, then finish the board. A diagonal neighbour does not count.
Name every tile that can slide into the blank, then finish the board. A diagonal neighbour does not count.
Plan the blank’s route before chasing a numbered tile. Compare the first moves, then find a shortest finish.
Plan the blank’s route before chasing a numbered tile. Compare the first moves, then find a shortest finish.
A legal move need not improve a position. Local routes and cycles demonstrate their stated effects; they do not prove a globally shortest solution. A study's minimum-distance claim requires a search that has ruled out every shorter route from that exact position. It is not a promise about general scrambles. The parity test below applies to this four-by-four board and this particular goal. A route that preserves a solved region is useful only while enough space remains to execute it. Generated scrambles are reachable, but an arbitrary rearrangement supplied in a study may not be.
Open Sliding Tiles →