Solving the Slitherlink poblem

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

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations

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 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.

Original languageEnglish
Title of host publicationProceedings - 2012 Conference on Technologies and Applications of Artificial Intelligence, TAAI 2012
Pages284-289
Number of pages6
DOIs
StatePublished - 1 Dec 2012
Event2012 Conference on Technologies and Applications of Artificial Intelligence, TAAI 2012 - Tainan, Taiwan
Duration: 16 Nov 201218 Nov 2012

Publication series

NameProceedings - 2012 Conference on Technologies and Applications of Artificial Intelligence, TAAI 2012

Conference

Conference2012 Conference on Technologies and Applications of Artificial Intelligence, TAAI 2012
CountryTaiwan
CityTainan
Period16/11/1218/11/12

Keywords

  • NP-completeness
  • Puzzle games
  • Slitherlink

Cite this

Liu, T. Y., Wu, I-C., & Sun, D. J. (2012). Solving the Slitherlink poblem. In Proceedings - 2012 Conference on Technologies and Applications of Artificial Intelligence, TAAI 2012 (pp. 284-289). [6395042] (Proceedings - 2012 Conference on Technologies and Applications of Artificial Intelligence, TAAI 2012). https://doi.org/10.1109/TAAI.2012.36