HEURISTIC APPROACHES FOR SOLVING N-QUEENS PROBLEM
The research article examines the three distinguished heuristics approaches for solving the N-Queens problem. The problem is widely recognized as constraint satisfaction problems (CSP) in the domain of Artificial Intelligence. The N-Queens problem demands the non-attacking placements of finite number of queens over chessboard. So that, two or more queens cannot share the horizontal, vertical and diagonal positions in a straight line. In this research work, improved version of Backtracking Recursive Algorithm, modified Min-Conflicts Algorithm and classic Genetic Algorithm are applied to address the problem. The comparative results validate the efficiency of research direction.
Journal of Applied and Emerging Sciences by BUITEMS is licensed under a Creative Commons Attribution 4.0 International License.
Based on a work at www.buitms.edu.pk.
Permissions beyond the scope of this license may be available at http://journal.buitms.edu.pk/j/index.php/bj