Two players X and Y take alternate turns in a game, starting with the diagram alongside. At each turn, one player writes one of 1, 2 or 3 in an empty circle, so that no two circles connected by an edge contain the same number. A player loses when they cannot go. In each of the five diagrams below it is Y's turn. In which of the diagrams can Y's move ensure that X loses the game?
Want a route through all this instead of an archive? The track
puts 2,604 problems in a working order, from Junior Challenge level to the IMO shortlist.
