{Sarbajit Manna Suklav Ghosh}

Abstract

N-Queen’s problem is the problem of placing N number of chessqueens on an NxN chessboard such that none of them attack each other. A chessqueen can move horizontally, vertically, and diagonally. So, the neighbours of aqueen have to be placed in such a way so that there is no clash in these three directions. Scientists accepts the fact that the branching factor increases in a nearlylinear fashion. With the use of artificial intelligence search patterns like BreadthFirst Search (BFS), Depth First Search (DFS) and backtracking algorithms, manyacademics have identified the problem and found out a number of techniques tocompute possible solutions to n-queen’s problem. The solutions using a blindapproach, that is, uninformed searches like BFS and DFS, use recursion. Also,backtracking uses recursion for the solution of this problem. All these recursivealgorithms use a system stack which is limited. So, for a small value of N, it exhausts the memory quickly though it depends on machine. This paper deals withthe above problem and proposes a non-recursive DFS search-based approach tosolve the problem to save system memory. In this work, Depth First Search (DFS)is used as a blind approach or uninformed search. This experimental study yieldsa noteworthy result in terms of time and space.