leetcode [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:

1. 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?

这是博弈论中非常典型的一个组合问题，由于每次最多拿3个石头，最少拿1个。假设双方代号为A,B.题目的意思就是判断当石头个数为N时，A能不能稳赢。下面分析一下：

当1<=n<=3时，A一次就可以拿完，保证拿到最后一颗石头，稳赢。

当N=4时，不管A拿多少，B都可以根据A的选择，拿走所有，B稳赢。

由此我们可以看出，当N>4时，每一个轮回，无论A选择拿几个，B都保证A+B=4,那么最后B稳赢，反之，A在一开始拿的时候应该根据N%4选择，然后根据B的选择，保证A+B=4，这样最后A稳赢。

综合上述，A、B在这场博弈游戏中，是存在赢的策略的，如果A稳赢，那么N一定不能为4的倍数。