Solving the Slitherlink Poblem

Title:	Solving the Slitherlink Poblem
Authors:	Liu, Tung-Ying Wu, I-Chen Sun, Der-Johng 資訊工程學系 Department of Computer Science
Keywords:	Slitherlink;NP-completeness;puzzle games
Issue Date:	2012
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.
URI:	http://hdl.handle.net/11536/20963 http://dx.doi.org/10.1109/TAAI.2012.36
ISBN:	978-0-7695-4919-4
DOI:	10.1109/TAAI.2012.36
Journal:	2012 CONFERENCE ON TECHNOLOGIES AND APPLICATIONS OF ARTIFICIAL INTELLIGENCE (TAAI)
Begin Page:	284
End Page:	289
Appears in Collections:	Conferences Paper

Files in This Item:

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.