Y by
Peer and Solveig are playing a game with
coins, all of which show
on one side and
on the opposite side. The coins are laid out in a row on the table. Peer and Solveig alternate taking turns. On his turn, Peer may turn over one or more coins, so long as he does not turn over two adjacent coins. On her turn, Solveig picks precisely two adjacent coins and turns them over. When the game begins, all the coins are showing
. Peer plays first, and he wins if all the coins show
simultaneously at any time. Find all
for which Solveig can keep Peer from winning.






This post has been edited 3 times. Last edited by Lil_flip38, Mar 20, 2025, 11:05 AM