资源介绍
acm算法-nim游戏篇（算法设计）
A number of Nim-like games in which moves are restricted somehow to occur from a
single pile are analysed. In each case the complete description of type P and type N
positions is obtained. A more detailed analysis of the Sprague-Grundy values of positions
in two heap Nim where the move must be from the larger heap is also presented.
- 上一篇: 狡猾的马丁格尔策略EA（附详细参数说明和复盘图片）
- 下一篇: 奥斯本：博弈入门部分课后习题解答