Show that \(\text{Nim}(x,y,z)\) is a losing position if and only if \(x \oplus y \oplus z = 0\). Remember that \(x \oplus y\) denotes the nim-sum of \(x\) and \(y\).
Is \(\text{Nim}(7,11,15)\) a winning position or a losing position? If it is a winning position, what is the optimal move?
Show that \(\text{Nim}(x_1,\dots,x_k)\) is an losing position if and only if \(x_1 \oplus \dots \oplus x_k = 0\). \(x \oplus y\) denotes the nim-sum of \(x\) and \(y\).
You may remember the game Nim. We will now play a slightly modified version, called Thrim. In Thrim, there are two piles of stones (or any objects of your choosing), one of size \(1\) and the other of size \(5\).
Whoever takes the last stone wins. The players take it in turns to remove stones - they can only remove stones from one pile at a time, and they can remove at most \(3\) stones at a time.
Does the player going first or the player going second have a winning strategy?