6.7.1 Nim

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68

/*

Solves normal-play nim and related impartial games where each position is the disjoint sum of
independent piles. In normal play, the player who makes the last move wins. A nim position is losing
exactly when the XOR of all pile sizes is 0.

This is the base case of the Sprague-Grundy theorem: every finite impartial game position is
equivalent to a Nim pile of size equal to its Grundy number, and sums of games combine by XOR.

- `nim_sum(piles)` returns the XOR of all pile sizes.
- `first_player_wins(piles)` returns whether the player to move has a winning strategy.
- `winning_move(piles)` returns a move (pile, new_size) that moves to XOR 0, or $(-1, -1)$ if the
  position is losing.

Time Complexity:
- O(n) per call, where $n$ is the number of piles.

Space Complexity:
- O(1) auxiliary.

*/

#include <utility>
#include <vector>

int nim_sum(const std::vector<int> &piles) {
  int x = 0;
  for (int p : piles) {
    x ^= p;
  }
  return x;
}

bool first_player_wins(const std::vector<int> &piles) {
  return nim_sum(piles) != 0;
}

std::pair<int, int> winning_move(const std::vector<int> &piles) {
  int x = nim_sum(piles);
  if (x == 0) {
    return {-1, -1};
  }
  for (int i = 0; i < static_cast<int>(piles.size()); i++) {
    if (int target = piles[i] ^ x; target < piles[i]) {
      return {i, target};
    }
  }
  return {-1, -1};
}

/*** Example Usage ***/

#include <cassert>
using namespace std;

int main() {
  vector<int> piles{3, 4, 5};
  assert(nim_sum(piles) == 2);
  assert(first_player_wins(piles));
  auto [pile_idx, new_size] = winning_move(piles);
  piles[pile_idx] = new_size;
  assert(nim_sum(piles) == 0);

  vector<int> losing{1, 2, 3};
  assert(!first_player_wins(losing));
  assert(winning_move(losing).first == -1);
  return 0;
}