The diagram shows a square divided into six smaller squares labelled A, B, C, D, E and F. Two squares are considered to be adjacent if they have more than one point in common. The numbers 1, 2, 3, 4, 5 and 6 are to be placed in the smaller squares, one in each, so that no two adjacent squares contain numbers differing by 3. How many different arrangements are possible?
This problem is not original.This problem is part of this set.
Your answer seems reasonable.
Find out if you're right!