[This problem has crossed the desk of Jan van de Snepscheut, but it may have been due to someone else.]
A square table has a coin at each corner. Design an execution sequence, each of whose steps consists of one of the following operations:
such that at some point during the execution (not necessarily at the end), a state where all coins are turned the same way (all heads or all tails) obtains.
©2020-2023 K.R.M. Leino - Split Template by One Page Love