Two Classic Chess Problems Solved by Answer Set Programming

Authors

  • 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

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.

Downloads

Published

2019-10-22

Issue

Vol. 6 No. 4 (2019): April 2019

Section

Articles

How to Cite

Silva, W. G. da, Almeida, T. da S., Carvallho, R. L. de, Silva, E. M. da, Oliveira, A. H. de, Botelho, G. M., & Martins, G. A. de S. (2019). Two Classic Chess Problems Solved by Answer Set Programming. International Journal of Advanced Engineering Research and Science, 6(4). https://journal-repository.com/index.php/ijaers/article/view/936