WEKO3
アイテム
Winning Strategies in Multimove Chess (i,j)
https://ipsj.ixsq.nii.ac.jp/records/142067
https://ipsj.ixsq.nii.ac.jp/records/14206746a4fca1-ba35-471f-ac0d-aa9271d3aae0
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
IPSJ-JNL5605007 (74.9 kB)
|
Copyright (c) 2015 by the Information Processing Society of Japan
|
|
| オープンアクセス | ||
| Item type | Journal(1) | |||||||||
|---|---|---|---|---|---|---|---|---|---|---|
| 公開日 | 2015-05-15 | |||||||||
| タイトル | ||||||||||
| タイトル | Winning Strategies in Multimove Chess (i,j) | |||||||||
| タイトル | ||||||||||
| 言語 | en | |||||||||
| タイトル | Winning Strategies in Multimove Chess (i,j) | |||||||||
| 言語 | ||||||||||
| 言語 | eng | |||||||||
| キーワード | ||||||||||
| 主題Scheme | Other | |||||||||
| 主題 | [特集：娯楽の離散数理] chess, chess with multiple moves per turn, chess variants, chess problems, Marseillais chess | |||||||||
| 資源タイプ | ||||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||||||
| 資源タイプ | journal article | |||||||||
| 著者所属 | ||||||||||
| Massachusetts Institute of Technology | ||||||||||
| 著者所属 | ||||||||||
| Massachusetts Institute of Technology | ||||||||||
| 著者所属(英) | ||||||||||
| en | ||||||||||
| Massachusetts Institute of Technology | ||||||||||
| 著者所属(英) | ||||||||||
| en | ||||||||||
| Massachusetts Institute of Technology | ||||||||||
| 著者名 |
EmilyRita, Berger
× EmilyRita, Berger
× Alexander, Dubbs
|
|||||||||
| 著者名(英) |
Emily, RitaBerger
× Emily, RitaBerger
× Alexander, Dubbs
|
|||||||||
| 論文抄録 | ||||||||||
| 内容記述タイプ | Other | |||||||||
| 内容記述 | We propose a class of chess variants, Multimove Chess (i,j), in which White gets i moves per turn and Black gets j moves per turn. One side is said to win when it takes the opponent's king. All other rules of chess apply. We prove that if (i,j) is not (1,1) or (2,2), and if i ≥ min(j,4), then White always has a winning strategy, and if i < (j,4), Black always has a winning strategy. ------------------------------ This is a preprint of an article intended for publication Journal of Information Processing(JIP). This preprint should not be cited. This article should be cited as: Journal of Information Processing Vol.23(2015) No.3 (online) DOI http://dx.doi.org/10.2197/ipsjjip.23.272 ------------------------------ |
|||||||||
| 論文抄録(英) | ||||||||||
| 内容記述タイプ | Other | |||||||||
| 内容記述 | We propose a class of chess variants, Multimove Chess (i,j), in which White gets i moves per turn and Black gets j moves per turn. One side is said to win when it takes the opponent's king. All other rules of chess apply. We prove that if (i,j) is not (1,1) or (2,2), and if i ≥ min(j,4), then White always has a winning strategy, and if i < (j,4), Black always has a winning strategy. ------------------------------ This is a preprint of an article intended for publication Journal of Information Processing(JIP). This preprint should not be cited. This article should be cited as: Journal of Information Processing Vol.23(2015) No.3 (online) DOI http://dx.doi.org/10.2197/ipsjjip.23.272 ------------------------------ |
|||||||||
| 書誌レコードID | ||||||||||
| 収録物識別子タイプ | NCID | |||||||||
| 収録物識別子 | AN00116647 | |||||||||
| 書誌情報 |
情報処理学会論文誌 巻 56, 号 5, 発行日 2015-05-15 |
|||||||||
| ISSN | ||||||||||
| 収録物識別子タイプ | ISSN | |||||||||
| 収録物識別子 | 1882-7764 | |||||||||
