WEKO3
アイテム
Hashi Solver
https://ipsj.ixsq.nii.ac.jp/records/71318
https://ipsj.ixsq.nii.ac.jp/records/71318cf0e5918-827d-47ba-9a2c-00cac244d9ff
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
IPSJ-GPWS2010013 (146.4 kB)
|
Copyright (c) 2010 by the Information Processing Society of Japan
|
|
| オープンアクセス | ||
| Item type | Symposium(1) | |||||||
|---|---|---|---|---|---|---|---|---|
| 公開日 | 2010-11-12 | |||||||
| タイトル | ||||||||
| タイトル | Hashi Solver | |||||||
| タイトル | ||||||||
| 言語 | en | |||||||
| タイトル | Hashi Solver | |||||||
| 言語 | ||||||||
| 言語 | eng | |||||||
| 資源タイプ | ||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_5794 | |||||||
| 資源タイプ | conference paper | |||||||
| 著者所属 | ||||||||
| Department of Computer Science & Information Engineering, National Dong Hwa University | ||||||||
| 著者所属 | ||||||||
| Department of Computer Science & Information Engineering, National Dong Hwa University | ||||||||
| 著者所属 | ||||||||
| Department of Computer Science & Information Engineering, National Dong Hwa University | ||||||||
| 著者所属 | ||||||||
| Department of Computer Science & Information Engineering, National Dong Hwa University | ||||||||
| 著者所属(英) | ||||||||
| en | ||||||||
| Department of Computer Science & Information Engineering, National Dong Hwa University | ||||||||
| 著者所属(英) | ||||||||
| en | ||||||||
| Department of Computer Science & Information Engineering, National Dong Hwa University | ||||||||
| 著者所属(英) | ||||||||
| en | ||||||||
| Department of Computer Science & Information Engineering, National Dong Hwa University | ||||||||
| 著者所属(英) | ||||||||
| en | ||||||||
| Department of Computer Science & Information Engineering, National Dong Hwa University | ||||||||
| 著者名 |
Shi-JimYen
× Shi-JimYen
|
|||||||
| 著者名(英) |
Shi-Jim, Yen
× Shi-Jim, Yen
|
|||||||
| 論文抄録 | ||||||||
| 内容記述タイプ | Other | |||||||
| 内容記述 | This paper proposes an efficient method to solve Hashi, a logical-type puzzle game with N by M grid. By using two methods, intersection method and elimination search, we can solve Hashi quickly and efficiency. The solver is authenticated by solving problems taken from Internet. | |||||||
| 論文抄録(英) | ||||||||
| 内容記述タイプ | Other | |||||||
| 内容記述 | This paper proposes an efficient method to solve Hashi, a logical-type puzzle game with N by M grid. By using two methods, intersection method and elimination search, we can solve Hashi quickly and efficiency. The solver is authenticated by solving problems taken from Internet. | |||||||
| 書誌レコードID | ||||||||
| 収録物識別子タイプ | NCID | |||||||
| 収録物識別子 | AA12496601 | |||||||
| 書誌情報 |
ゲームプログラミングワークショップ2010論文集 巻 2010, 号 12, p. 71-74, 発行日 2010-11-12 |
|||||||
| 出版者 | ||||||||
| 言語 | ja | |||||||
| 出版者 | 情報処理学会 | |||||||
