Proof Writing & Problem Solving · Superchallenge problem

Ten lamps stand around a circle, all off. A move chooses one lamp and switches it and its two neighbours (each of the three changes from off to on or from on to off). What is the fewest number of moves after which exactly one lamp is on?