Abstract
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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
