Share Your Research, Maximize Your Social Impacts
Two Classic Chess Problems Solved by Answer Set Programming
Journal: International Journal of Advanced Engineering Research and Science (Vol.6, No. 4)Publication Date: 2019-04-10
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;
Page : 373-377
Keywords : Combinatorial problems; Answer Set Programming; Computation applied.;
Source : Download
Find it from : Google Scholar
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.
Other Latest Articles
- THE CHANGES IN EATING HABIT AFTER NUTRITIONAL EDUCATION ON ANEMIA MATERNAL
- A REVIEW OF THREATENED AND RISKED ENTOMOPHAUNA ON SHKODRA LAKE AREA
- THE SURFACE WATERS THAT FLOW TO LAKE OHRID AND ROLE OF DIATOMS IN BIOLOGICAL MONITORING
- ANALYSIS OF EMISSIONS FROM DIESEL PASSENGER CARS IN NORTH MACEDONIA
- Socio-Ecological Implications of Soy in the Brazilian Cerrado
Last modified: 2019-05-04 16:23:54