http://swrc.ontoware.org/ontology#TechnicalReport
Some Formulas for Max Nim
en
Kwansei Gakuin High School
Kwansei Gakuin University
Kwansei Gakuin University
Hiroshima University
Ryohei Miyadera
Sohta Kannan
Kai Hirokawa
Masanori Fukui
In this article, the authors present some theorems of Max Nim that is a combinatorial game. Suppose that there is a pile of n stones, and two players take turns to remove stones from the pile. In each turn, if the number of stones is m the player is allowed to remove at least one and at most
In this article, the authors present some theorems of Max Nim that is a combinatorial game. Suppose that there is a pile of n stones, and two players take turns to remove stones from the pile. In each turn, if the number of stones is m the player is allowed to remove at least one and at most
AA11362144
研究報告ゲーム情報学（GI）
2018-GI-40
9
1-3
2018-06-22
2188-8736