journal-of-information-and-optimization-sciences Journal of Information and Optimization Sciences 2169-0103 0252-2667 Taru Publications 10.47974/JIOS-1440 A heuristic based linear time O(N) novel solution to N-Queen problem Kholiya Gaurav Computer Science & Engineering, Graphic Era Hill University, Dehradun, Uttarakhand, India Sharma Vikrant Computer Science & Engineering, Graphic Era Hill University, Dehradun, Uttarakhand, India Vats Satvik Computer Science & Engineering, Graphic Era Hill University, Dehradun, Uttarakhand, India Garg Vijay School of Computer Science & Engineering, Lovely Professional University, Punjab, India 44 6 1087 1096 11 11 2023

N-Queen problem is a classic puzzle in which ‘N’ number of queens and a chessboard of size N X N is given. The puzzle is to lay all the given queens on the chessboard in a way that all queens are safe (i.e., no queen on the chessboard is intersecting the other queen). In this article we have proposed an algorithm to solve the N-Queen puzzle in O(N) time-complexity, without affecting the space-complexity.

 N-Queen problem Polynomial time Exponential time access open retracted no