Solving the Slitherlink Poblem
| dc.citation.epage | 289 | en_US |
| dc.citation.spage | 284 | en_US |
| dc.contributor.author | Liu, Tung-Ying | en_US |
| dc.contributor.author | Wu, I-Chen | en_US |
| dc.contributor.author | Sun, Der-Johng | en_US |
| dc.contributor.department | 資訊工程學系 | zh_TW |
| dc.contributor.department | Department of Computer Science | en_US |
| dc.date.accessioned | 2014-12-08T15:29:03Z | |
| dc.date.available | 2014-12-08T15:29:03Z | |
| dc.date.issued | 2012 | en_US |
| dc.description.abstract | Slitherlink is one of challenging puzzle games to human and computer players. In this paper, we propose an efficient method to solve Slitherlink puzzles. After using this method, we can solve each of 10,000 25x30 puzzles given in [9] within 0.05 seconds. Without using the method, it takes at least 10 minutes to solve some of these puzzles. | en_US |
| dc.identifier.doi | 10.1109/TAAI.2012.36 | en_US |
| dc.identifier.isbn | 978-0-7695-4919-4 | en_US |
| dc.identifier.journal | 2012 CONFERENCE ON TECHNOLOGIES AND APPLICATIONS OF ARTIFICIAL INTELLIGENCE (TAAI) | en_US |
| dc.identifier.uri | http://dx.doi.org/10.1109/TAAI.2012.36 | en_US |
| dc.identifier.uri | https://ir.lib.nycu.edu.tw/handle/11536/20963 | |
| dc.identifier.wosnumber | WOS:000313560200046 | |
| dc.language.iso | en_US | en_US |
| dc.subject | Slitherlink | en_US |
| dc.subject | NP-completeness | en_US |
| dc.subject | puzzle games | en_US |
| dc.title | Solving the Slitherlink Poblem | en_US |
| dc.type | Proceedings Paper | en_US |