In a game with two players X and Y and given n (\(\ge\) 4) number of circles drawn on a plane paper, alternately each one of X and Y is suppose to join two different circles which were not already joined by a line. The winner is one who joins the last available pair of circles and the game ends. If X starts the game then :
MH SET - 2019, SET Exam - 2019,
Answer: D
The answer is Y wins whenever n is a power of 2.
Each move joins one new pair of circles, so the game lasts exactly as many moves as there are pairs, whatever the players do:
\[ \binom{n}{2} = \frac{n(n-1)}{2} \]
X makes the odd-numbered moves and Y the even-numbered ones, so Y makes the last move, and wins, exactly when this number is even. When n is a power of 2 with \(n \ge 4\), n is a multiple of 4, so \(n(n-1)/2\) is even and Y wins.
Neither player always wins (n = 6 gives 15 moves, a win for X; n = 4 gives 6, a win for Y). 'X wins whenever n is odd' fails for n = 5, which gives 10 moves and a win for Y.
Please log in or register to report this question.