Solving the Slitherlink Poblem

標題:	Solving the Slitherlink Poblem
作者:	Liu, Tung-Ying Wu, I-Chen Sun, Der-Johng 資訊工程學系 Department of Computer Science
關鍵字:	Slitherlink;NP-completeness;puzzle games
公開日期:	2012
摘要:	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
期刊:	2012 CONFERENCE ON TECHNOLOGIES AND APPLICATIONS OF ARTIFICIAL INTELLIGENCE (TAAI)
起始頁:	284
結束頁:	289
顯示於類別：	會議論文

文件中的檔案：

若為 zip 檔案，請下載檔案解壓縮後，用瀏覽器開啟資料夾中的 index.html 瀏覽全文。