No Detail Found!

Heuristic approaches for solving n-queens problem

Author(s)
Aftab Ahmed Department of Computer Science, Balochistan University of Information Technology, Engineering & Management Sciences, Quetta, Pakistan
Mazhar Al Department of Computer Science, Balochistan University of Information Technology, Engineering & Management Sciences, Quetta, Pakistan
Ali Kamran Institute of Space Technology, Islamabad, Pakistan
Abdul Wahid Shaikh Department of Computer Science, SALU, Khairpur, Pakistan
Abstract
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.
Publication Details
Page(s) 197-201
DOI DOI not available
Published Journal: Journal of Applied and Emerging Sciences , Volume: 2, Issue: 2, Year: 2011

Request the full text from PASTIC

More from Journal of Applied and Emerging Sciences
0

Citations

0

Downloads

51

Views

Copyright ©  PASTIC National Center, Islamabad www.pastic.gov.pk