2021-07-29T19:18:28Zhttps://ipsj.ixsq.nii.ac.jp/ej/?action=repository_oaipmhoai:ipsj.ixsq.nii.ac.jp:001903172020-04-01T00:33:29Z01164:05305:09416:09515
Some Formulas for Max NimSome Formulas for Max Nimenghttp://id.nii.ac.jp/1001/00190229/Technical Reporthttps://ipsj.ixsq.nii.ac.jp/ej/?action=repository_action_common_download&item_id=190317&item_no=1&attribute_id=1&file_no=1Copyright (c) 2018 by the Information Processing Society of JapanKwansei Gakuin High SchoolKwansei Gakuin UniversityKwansei Gakuin UniversityHiroshima UniversityRyohei, MiyaderaSohta, KannanKai, HirokawaMasanori, FukuiIn 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-409132018-06-222188-87362018-06-20