Consider a row of N pegs. Two players take alternate turns removing any individual peg or any 2 adjacent pegs. For what values of N does first playe

Consider a row of N pegs. Two players take alternate turns removing any individual peg or any 2 adjacent pegs.
For what values of N does first player win and what strategy does he use.
Assuming that the player who takes the last peg wins...
The first player has a winning strategy for any N.
On his first move, If N is even, he takes the middle two pegs and if N is odd he takes the middle peg. This divides the pegs into two groups of equal numbers of pegs.
On subsequent moves, he just mimics the move made by the second player, but in the opposite group.
Indeed, this is very closely related to the round table and dishes problem :-)