Two Classic Chess Problems Solved by Answer Set Programming |
| ( Vol-6,Issue-4,April 2019 ) OPEN ACCESS |
| Author(s): |
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 |
| Keywords: |
|
Combinatorial problems, Answer Set Programming, Computation applied. |
| Abstract: |
|
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. |
 DOI:
|
| Paper Statistics: |
|
| Cite this Article: |
| Click here to get all Styles of Citation using DOI of the article. |
- Track Your Paper
- editor.ijaers@gmail.com
- ISSN : 2349-6495(P) | 2456-1908(O)
Advanced Engineering Research and Science