[poj2484] A Funny Game (symmetric game)

Title: http://poj.org/problem?id=2484

Test instructions: N a stone around a circle, two people take turns, each time can take a stone or adjacent to the two stones, ask the first win or the next win

Analysis:

A typical symmetric game

If n>=3, then no matter how the choice, the hand can choose a way to make the remaining two is the same length of the chain, then regardless of how the operation of the next, as long as in the later game to take the same symmetrical operation, will be able to let the opponent lose

[poj2484] A Funny Game (symmetric game)