Two Classic Chess Problems Solved by Answer Set Programming
Warley Gramacho da Silva, Tiago da Silva Almeida, Rafael Lima de Carvallho, Edeilson Milhomem da Silva, Ary Henrique de Oliveira, Glenda Michele Botelho, Glêndara Aparecida de Souza Martins · International Journal of Advanced Engineering Research and Science · 2019
The n-Queen and the Knight's tour problem are studied by several authors who have proposed some methods to solve them.The ASP (Answer Set Programming) is a form of declarative programming oriented to difficult search problems; however, the literature does not present its use in solving these two classic and interesting chess puzzles.Thus, this work aims to solve the n-Queen and Knight's Tour problems by ASP and show it can solve combinatorial problems.