An exercise from Matousek's discrete math book.
Two people playing a game, they agree on a number n. Then they write 0 or 1 in turns until one of them is forced to repeat a pattern of length n. Then the game terminates and that person loses.
Question 1: if n is odd, show that the second person has a simple winning strategy.
Question 2: if n=4, show that the first person has a winning strategy.
It was mentioned that for even n >=6 it is an open problem.
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment