There are 2012 lamps arranged on a table. Two persons Diana and Ethan play the following game.
In each move the player flips the switch of one lamp, but he or she must never get back an arrangement of the lit lamps that has already been on the table. A player who cannot move loses.

Diana makes the first move, followed by Ethan. Who has a winning strategy?

(In reply to Possible solution by broll)

How do you know the last possible combination of yours is always reachable?

Posted by Ady TZIDON on 2015-04-18 03:45:44