| Item type |
SIG Technical Reports(1) |
| 公開日 |
2016-07-18 |
| タイトル |
|
|
タイトル |
Generating All Solutions of Minesweeper Problem Using Degree Constrained Subgraph Model |
| タイトル |
|
|
言語 |
en |
|
タイトル |
Generating All Solutions of Minesweeper Problem Using Degree Constrained Subgraph Model |
| 言語 |
|
|
言語 |
eng |
| 資源タイプ |
|
|
資源タイプ識別子 |
http://purl.org/coar/resource_type/c_18gh |
|
資源タイプ |
technical report |
| 著者所属 |
|
|
|
Graduate School of Information Science and Technology, Hokkaido University |
| 著者所属 |
|
|
|
Graduate School of Information Science and Technology, Hokkaido University |
| 著者所属 |
|
|
|
Graduate School of Information Science and Technology, Hokkaido University |
| 著者所属(英) |
|
|
|
en |
|
|
Graduate School of Information Science and Technology, Hokkaido University |
| 著者所属(英) |
|
|
|
en |
|
|
Graduate School of Information Science and Technology, Hokkaido University |
| 著者所属(英) |
|
|
|
en |
|
|
Graduate School of Information Science and Technology, Hokkaido University |
| 著者名 |
Hirofumi, Suzuki
Sun, Hao
Shin-ichi, Minato
|
| 著者名(英) |
Hirofumi, Suzuki
Sun, Hao
Shin-ichi, Minato
|
| 論文抄録 |
|
|
内容記述タイプ |
Other |
|
内容記述 |
Minesweeper is one of the most popular puzzle game. Several kinds of decision or counting problems on Minesweeper have been studied. In this paper, we consider the problem to generate all possible solutions for a given Minesweeper board, and propose a new formulation of the problem using a graph structure, called degree constrained subgraph model. We show experimental results of our efficient graph enumeration techniques for various sizes of Minesweeper boards. |
| 論文抄録(英) |
|
|
内容記述タイプ |
Other |
|
内容記述 |
Minesweeper is one of the most popular puzzle game. Several kinds of decision or counting problems on Minesweeper have been studied. In this paper, we consider the problem to generate all possible solutions for a given Minesweeper board, and propose a new formulation of the problem using a graph structure, called degree constrained subgraph model. We show experimental results of our efficient graph enumeration techniques for various sizes of Minesweeper boards. |
| 書誌レコードID |
|
|
収録物識別子タイプ |
NCID |
|
収録物識別子 |
AN10505667 |
| 書誌情報 |
研究報告数理モデル化と問題解決（MPS）
巻 2016-MPS-109,
号 3,
p. 1-4,
発行日 2016-07-18
|
| ISSN |
|
|
収録物識別子タイプ |
ISSN |
|
収録物識別子 |
2188-8833 |
| Notice |
|
|
|
SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc. |
| 出版者 |
|
|
言語 |
ja |
|
出版者 |
情報処理学会 |
IPSJ-MPS16109003.pdf (555.1 kB)
