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.
