Variant of nim game with particular rules
-
05-11-2019 - |
質問
Let's say we have the following rule for that particular Nim game: You have multiple heaps, and you have to remove 1,2 or 3 sticks (not more) from a SINGLE choosen heap. The player who pick up the last stick LOSES. (misere game). Is there an algorithm which solves this variant of Nim game ?
Thanks in advance!
正しい解決策はありません
所属していません cs.stackexchange