OME 1999 Problem 3
A one player game is played on the triangular board shown on the picture. A token is placed on each circle. Each token is white on one side and black on the other. Initially, the token at one vertex of the triangle has the black side up, while the others have the white sides up. A move consists of removing a token with the black side up and turning over the adjacent tokens (two tokens are adjacent if they are joined by a segment). Is it possible to remove all the tokens by a sequence of moves?
Dataset text AI-MO AoPS. Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.