WEKO3
アイテム
NP-Completeness of Pandemic
https://ipsj.ixsq.nii.ac.jp/records/82611
https://ipsj.ixsq.nii.ac.jp/records/82611e9a0202e-9a62-4388-99c0-06a2812d5f86
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
IPSJ-JNL5306014 (354.2 kB)
|
Copyright (c) 2012 by the Information Processing Society of Japan
|
|
| オープンアクセス | ||
| Item type | Journal(1) | |||||||||
|---|---|---|---|---|---|---|---|---|---|---|
| 公開日 | 2012-06-15 | |||||||||
| タイトル | ||||||||||
| タイトル | NP-Completeness of Pandemic | |||||||||
| タイトル | ||||||||||
| 言語 | en | |||||||||
| タイトル | NP-Completeness of Pandemic | |||||||||
| 言語 | ||||||||||
| 言語 | eng | |||||||||
| キーワード | ||||||||||
| 主題Scheme | Other | |||||||||
| 主題 | [特集：パズルの数理] NP-completeness, game | |||||||||
| 資源タイプ | ||||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||||||
| 資源タイプ | journal article | |||||||||
| 著者所属 | ||||||||||
| The University of Electro-Communications | ||||||||||
| 著者所属 | ||||||||||
| The University of Electro-Communications | ||||||||||
| 著者所属(英) | ||||||||||
| en | ||||||||||
| The University of Electro-Communications | ||||||||||
| 著者所属(英) | ||||||||||
| en | ||||||||||
| The University of Electro-Communications | ||||||||||
| 著者名 |
Kenichiro, Nakai
× Kenichiro, Nakai
× Yasuhiko, Takenaga
|
|||||||||
| 著者名(英) |
Kenichiro, Nakai
× Kenichiro, Nakai
× Yasuhiko, Takenaga
|
|||||||||
| 論文抄録 | ||||||||||
| 内容記述タイプ | Other | |||||||||
| 内容記述 | Pandemic is a multi-player board game which simulates the outbreak of epidemics and the human effort to prevent them. It is a characteristic of this game that all the players cooperate for a goal and they are not competitive. We show that the problem to decide if the player can win the generalized Pandemic from the given situation of the game is NP-complete. ------------------------------ 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.20(2012) No.3 (online) DOI http://dx.doi.org/10.2197/ipsjjip.20.723 ------------------------------ |
|||||||||
| 論文抄録(英) | ||||||||||
| 内容記述タイプ | Other | |||||||||
| 内容記述 | Pandemic is a multi-player board game which simulates the outbreak of epidemics and the human effort to prevent them. It is a characteristic of this game that all the players cooperate for a goal and they are not competitive. We show that the problem to decide if the player can win the generalized Pandemic from the given situation of the game is NP-complete. ------------------------------ 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.20(2012) No.3 (online) DOI http://dx.doi.org/10.2197/ipsjjip.20.723 ------------------------------ |
|||||||||
| 書誌レコードID | ||||||||||
| 収録物識別子タイプ | NCID | |||||||||
| 収録物識別子 | AN00116647 | |||||||||
| 書誌情報 |
情報処理学会論文誌 巻 53, 号 6, 発行日 2012-06-15 |
|||||||||
| ISSN | ||||||||||
| 収録物識別子タイプ | ISSN | |||||||||
| 収録物識別子 | 1882-7764 | |||||||||
