两名玩家正在玩一个游戏,每个回合必须选择1、2、3或4枚硬币。总共有n枚硬币。捡到最后一枚硬币的玩家获胜。设计一个策略来赢得比赛。
假设我是玩家之一,那么解决问题的算法策略是什么,这样我就可以赢得游戏?
制作前10场左右游戏的表格;将会有一个明确的模式。如果有…
1 coin: take 1, you win
2 coins: take 2, you win
3 coins: take 3, you win
4 coins: take 4, you win
5 coins: you lose (whatever you choose, the opponent wins by rule 1-4)
6 coins: take 1, opponent loses by rule 5
7 coins: take 2, opponent loses by rule 5
...
10 coins: you lose (whatever you choose, the opponent wins by rule 6-9)
11 coins: take 1, opponent loses by rule 10
...
所以,你总是拿n % 5
硬币,除非是0
(如果是0
,无论你做什么,你都会输给对手,所以拿1来最大限度地增加他犯错的机会)。