Presenting an algorithm for solving N queens’ problem

The N queens’ problem is one of the most popular combinational topics to determine number of states that nonattacking N queens should be placed on the N × N chessboard. In this paper we presented an algorithm by combination of using backtracking algorithm and stack data structure. Then the algorithm was programmed by Microsoft Visual Studio ۲۰۰۸. In closing, the outputs of our algorithm include number of states and locations of queens in chessboard were described

کلیدواژه ها:

N queens’ problem ، Backtracking algorithm ، Stack data structure ، Programming ، Run time