| Item type |
SIG Technical Reports(1) |
| 公開日 |
2024-06-07 |
| タイトル |
|
|
タイトル |
Maximum Nim and Josephus Problem |
| タイトル |
|
|
言語 |
en |
|
タイトル |
Maximum Nim and Josephus Problem |
| 言語 |
|
|
言語 |
eng |
| 資源タイプ |
|
|
資源タイプ識別子 |
http://purl.org/coar/resource_type/c_18gh |
|
資源タイプ |
technical report |
| 著者所属 |
|
|
|
Faculty of Environment and Information Studies, Keio University |
| 著者所属 |
|
|
|
Graduate School of Information Science, University of Hyogo |
| 著者所属 |
|
|
|
Keimei Gakuin Junior and Senior High School |
| 著者所属 |
|
|
|
Keimei Gakuin Junior and Senior High School |
| 著者所属 |
|
|
|
Keimei Gakuin Junior and Senior High School |
| 著者所属(英) |
|
|
|
en |
|
|
Faculty of Environment and Information Studies, Keio University |
| 著者所属(英) |
|
|
|
en |
|
|
Graduate School of Information Science, University of Hyogo |
| 著者所属(英) |
|
|
|
en |
|
|
Keimei Gakuin Junior and Senior High School |
| 著者所属(英) |
|
|
|
en |
|
|
Keimei Gakuin Junior and Senior High School |
| 著者所属(英) |
|
|
|
en |
|
|
Keimei Gakuin Junior and Senior High School |
| 著者名 |
Shoei, Takahashi
Yuki, Tokuni
Akito, Tsujii
Hikaru, Manabe
Ryohei, Miyadera
|
| 著者名(英) |
Shoei, Takahashi
Yuki, Tokuni
Akito, Tsujii
Hikaru, Manabe
Ryohei, Miyadera
|
| 論文抄録 |
|
|
内容記述タイプ |
Other |
|
内容記述 |
This study examines the relation between the Grundy numbers of a Maximum Nim and Josephus problem. Let f(x)=[x/k] where [ ] is a floor function and k is a positive integer such that k ≧ 2. We prove that there is a simple relation between a Maximum Nim with the rule function f and the Josephus problem, in which every k-th number is to be removed. Based on this relation, we propose a new method for solving the Josephus problem. |
| 論文抄録(英) |
|
|
内容記述タイプ |
Other |
|
内容記述 |
This study examines the relation between the Grundy numbers of a Maximum Nim and Josephus problem. Let f(x)=[x/k] where [ ] is a floor function and k is a positive integer such that k ≧ 2. We prove that there is a simple relation between a Maximum Nim with the rule function f and the Josephus problem, in which every k-th number is to be removed. Based on this relation, we propose a new method for solving the Josephus problem. |
| 書誌レコードID |
|
|
収録物識別子タイプ |
NCID |
|
収録物識別子 |
AA11362144 |
| 書誌情報 |
研究報告ゲーム情報学（GI）
巻 2024-GI-52,
号 10,
p. 1-7,
発行日 2024-06-07
|
| ISSN |
|
|
収録物識別子タイプ |
ISSN |
|
収録物識別子 |
2188-8736 |
| Notice |
|
|
|
SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc. |
| 出版者 |
|
|
言語 |
ja |
|
出版者 |
情報処理学会 |
IPSJ-GI24052010.pdf (829.4 kB)
