> For the complete documentation index, see [llms.txt](https://maksimdan.gitbook.io/interview-practice-problems/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/nim_game_292.md).

# 292 Nim Game

You are playing the following Nim Game with your friend: There is a heap of stones on the table, each time one of you take turns to remove 1 to 3 stones. The one who removes the last stone will be the winner. You will take the first turn to remove the stones.

Both of you are very clever and have optimal strategies for the game. Write a function to determine whether you can win the game given the number of stones in the heap.

For example, if there are 4 stones in the heap, then you will never win the game: no matter 1, 2, or 3 stones you remove, the last stone will always be removed by your friend.

Hint:

If there are 5 stones in the heap, could you figure out a way to remove the stones such that you will always be the winner?

```cpp
  class Solution {
  public:
      bool canWinNim(int n) {
          return n % 4 != 0;
      }
  };
```

Another way of approaching this problem is through dynammic programming. The idea goes as follows: First consider the first three cases: 0, 1, 2, 3. In each of these scenarios, we can just take the maximum number of stones, and win the game. I can use this to initialize my map first the first 3 cases.

Next, we consider 4. Each of the case we take 3, 2, or 1 - this will lead your opponent is taking the remainder. We can model this to say that if for all cache\[n-i] in 1:3, then this leads to a lose. However, if in any case, we can find at least a single path that leads us to victory, then we can select this path.

Using this method, we can then familiarize ourselfs with the pattern, and the first solution mentioned.

![](/files/-LoJIdZ7kEg5UcwOujHC)

```python
def canWinNim(self, n):
    """
    :type n: int
    :rtype: bool
    """

    # start us off
    cache = {0: True, 1: True, 2: True, 3: True}
    if cache.__contains__(n):
        return cache[n]

    result = False
    for n_stones in range(4, n+1):
        if all(cache[n_stones-pick] for pick in range(1,4)):
            cache[n_stones] = False
        else:
            cache[n_stones] = True

    return cache[n]
```


---

# Agent Instructions
This documentation is published with GitBook. GitBook is the documentation platform designed so that both humans and AI agents can read, navigate, and reason over technical content effectively. Learn more at gitbook.com.

## Querying This Documentation
If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter, and the optional `goal` query parameter:

```
GET https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/nim_game_292.md?ask=<question>&goal=<endgoal>
```

`ask` is the immediate question: it should be specific, self-contained, and written in natural language.
`goal` is optional and describes the broader end goal you are ultimately trying to accomplish on behalf of the user. GitBook uses it to tailor the answer towards what is most useful for that goal.

The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.