RU-ALLRUSSIAN 1977 Problem 4
Black and white tokens are placed around a circle. First all the black tokens with one or two white neighbors are removed. Then all white tokens with one or two black neighbors are removed. Then all black tokens with one or two white neighbors and so on until all the tokens have the same color. Is it possible to arrange 40 tokens so that only one remains after 4 moves? What is the minimum possible number of moves to go from 1000 tokens to one?
Dataset text NuminaMath olympiads. 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.