Solving the Slitherlink poblem

Tung Ying Liu*, I-Chen Wu, Der Johng Sun

*此作品的通信作者

研究成果: Conference contribution同行評審

2 引文 斯高帕斯(Scopus)

摘要

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 25×30 puzzles given in [9] within 0.05 seconds. Without using the method, it takes at least 10 minutes to solve some of these puzzles.

原文English
主出版物標題Proceedings - 2012 Conference on Technologies and Applications of Artificial Intelligence, TAAI 2012
頁面284-289
頁數6
DOIs
出版狀態Published - 1 12月 2012
事件2012 Conference on Technologies and Applications of Artificial Intelligence, TAAI 2012 - Tainan, Taiwan
持續時間: 16 11月 201218 11月 2012

出版系列

名字Proceedings - 2012 Conference on Technologies and Applications of Artificial Intelligence, TAAI 2012

Conference

Conference2012 Conference on Technologies and Applications of Artificial Intelligence, TAAI 2012
國家/地區Taiwan
城市Tainan
期間16/11/1218/11/12

指紋

深入研究「Solving the Slitherlink poblem」主題。共同形成了獨特的指紋。

引用此