There's 16 buttons arranged in a 4 by 4 square. They are coloured either red, or green. They appear like this (red being 1, green being 0)
Each press will switch all the buttons diagonal of it, and the button on the exact opposite of it (for example the one exact opposite of the one in the top left corner is the bottom right.) Not to mention itself.
An example of pressing would be, if you press the first 1 on the second row, the following would happen:
They changes happen in this order:
- The button you press changes
- The buttons diagonal of it by 1 button changes
- The opposite button changes
You're mission is to switch it all to either 1 or 0, in the minimum moves required. What is this minimum amount and what moves are in the required sequence?