NP-Completeness of Pandemic

スポンサーリンク

概要

• 論文の詳細を見る

• 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.

著者

• Takenaga Yasuhiko

  The University of Electro-Communications

• Nakai Kenichiro

  The University of Electro-Communications

関連論文

• NP-Completeness of Pandemic
• NP-Completeness of Pandemic

スポンサーリンク