IBM Ponder This #173 · September 2012

Remember the June 2011 challenge? It was about parking two units long cars along the circumference of a circle with one unit long segments.

We now change this parking challenge into a two players game, where each player parks a car in turn. The first player unable to park a car (i.e., when all the remaining spaces are only one-unit-long intervals) loses.

If the size of the parking area is 11 units, the first player has a winning strategy.

Find another possible size of the parking space, N, for which the first player has a winning strategy and N consists only of the digits 0 and 1.

Solution

Best opened after a real attempt

To be added.