A loop changes tile order
Watch the displaced tiles as you route the blank. Reach the target, then compare your route with the checked shortest route.
PRACTICE COLLECTION
Four studies in future consequences. Distinguish a verified finish, a short tactical proof and a useful feature that does not establish a win.
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.
Watch the displaced tiles as you route the blank. Reach the target, then compare your route with the checked shortest route.
Watch the displaced tiles as you route the blank. Reach the target, then compare your route with the checked shortest route.
Calculate inversions while ignoring the blank. Add the blank’s row counted from the bottom. Is this position reachable from the target? Then solve it.
Calculate inversions while ignoring the blank. Add the blank’s row counted from the bottom. Is this position reachable from the target? Then solve it.
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 →