1. You are Here：

Full metadata record
DC FieldValueLanguage
dc.contributor.authorLiu, Tung-Yingen_US
dc.contributor.authorWu, I-Chenen_US
dc.contributor.authorSun, Der-Johngen_US
dc.date.accessioned2014-12-08T15:29:03Z-
dc.date.available2014-12-08T15:29:03Z-
dc.date.issued2012en_US
dc.identifier.isbn978-0-7695-4919-4en_US
dc.identifier.urihttp://hdl.handle.net/11536/20963-
dc.identifier.urihttp://dx.doi.org/10.1109/TAAI.2012.36en_US
dc.description.abstractSlitherlink 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.language.isoen_USen_US
dc.subjectSlitherlinken_US
dc.subjectNP-completenessen_US
dc.subjectpuzzle gamesen_US
dc.titleSolving the Slitherlink Poblemen_US
dc.typeProceedings Paperen_US
dc.identifier.doi10.1109/TAAI.2012.36en_US
dc.identifier.journal2012 CONFERENCE ON TECHNOLOGIES AND APPLICATIONS OF ARTIFICIAL INTELLIGENCE (TAAI)en_US
dc.citation.spage284en_US
dc.citation.epage289en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:000313560200046-
Appears in Collections:Conferences Paper


Files in This Item:

  1. 000313560200046.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.

Related Contents
Loading...