WEKO3
アイテム
Nurikabe, heuristic search, puzzle
https://ipsj.ixsq.nii.ac.jp/records/97727
https://ipsj.ixsq.nii.ac.jp/records/97727b02c66ca-c858-41d7-9adc-1067b58d9000
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
IPSJ-GPWS2009014.pdf (195.4 kB)
|
Copyright (c) 2009 by the Information Processing Society of Japan
|
|
| オープンアクセス | ||
| Item type | Symposium(1) | |||||||
|---|---|---|---|---|---|---|---|---|
| 公開日 | 2009-11-06 | |||||||
| タイトル | ||||||||
| タイトル | Nurikabe, heuristic search, puzzle | |||||||
| タイトル | ||||||||
| 言語 | en | |||||||
| タイトル | Nurikabe, heuristic search, puzzle | |||||||
| 言語 | ||||||||
| 言語 | eng | |||||||
| 資源タイプ | ||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_5794 | |||||||
| 資源タイプ | conference paper | |||||||
| 著者所属 | ||||||||
| Department of Computer Science and Information Engineering, National Dong Hwa University | ||||||||
| 著者所属 | ||||||||
| Department of Applied Math, Chung Yuan Christian University | ||||||||
| 著者所属 | ||||||||
| Department of Computer Science and Information Engineering, National Dong Hwa University | ||||||||
| 著者所属 | ||||||||
| Department of Computer Science and Information Engineering, National Dong Hwa University | ||||||||
| 著者所属(英) | ||||||||
| en | ||||||||
| Department of Computer Science and Information Engineering, National Dong Hwa University | ||||||||
| 著者所属(英) | ||||||||
| en | ||||||||
| Department of Applied Math, Chung Yuan Christian University | ||||||||
| 著者所属(英) | ||||||||
| en | ||||||||
| Department of Computer Science and Information Engineering, National Dong Hwa University | ||||||||
| 著者所属(英) | ||||||||
| en | ||||||||
| Department of Computer Science and Information Engineering, National Dong Hwa University | ||||||||
| 著者名 |
YenShi-Jim
× YenShi-Jim
|
|||||||
| 著者名(英) |
Yen, Shi-Jim
× Yen, Shi-Jim
|
|||||||
| 論文抄録 | ||||||||
| 内容記述タイプ | Other | |||||||
| 内容記述 | This paper proposed a heuristic search by mixing pattern matching method to solve Nurikabe puzzle games. First, find the basic rule of puzzle games, and determined part of the region quickly. Then use the advanced detection to answer the part in which basic rule is not able to solve. After heuristic detection, we use Depth-First-Search to solve remain part of question. Authenticating Our method by solving the puzzle problems from internet, confirm that using heuristic search can improve solving speed and efficient. | |||||||
| 論文抄録(英) | ||||||||
| 内容記述タイプ | Other | |||||||
| 内容記述 | This paper proposed a heuristic search by mixing pattern matching method to solve Nurikabe puzzle games. First, find the basic rule of puzzle games, and determined part of the region quickly. Then use the advanced detection to answer the part in which basic rule is not able to solve. After heuristic detection, we use Depth-First-Search to solve remain part of question. Authenticating Our method by solving the puzzle problems from internet, confirm that using heuristic search can improve solving speed and efficient. | |||||||
| 書誌情報 |
ゲームプログラミングワークショップ2009論文集 巻 2009, 号 12, p. 83-86, 発行日 2009-11-06 |
|||||||
| 出版者 | ||||||||
| 言語 | ja | |||||||
| 出版者 | 情報処理学会 | |||||||
