A Snake on a 3x3 Grid
Combinatorics · 27th PMO Qualifying Stage
How many ways are there to write each integer from 1 to 6 on a different unit square of a $3\times 3$ square grid, such that consecutive integers are on adjacent squares, and 1 is not adjacent to 6? (Note that adjacent squares are squares that share a common side.)