An Unique Solution for N queen Problem
Vishal Kesri, Vaibhav Kesri, Prasant Ku. Pattnaik · International Journal of Computer Applications · 2012
The N-queens problem is a popular classic puzzle where numbers of queen were to be placed on an n x n matrix such that no queen can attack any other queen.The Branching Factor grows in a roughly linear way, which is an important consideration for the researchers.However, many researchers have cited the issues with help of artificial intelligence search patterns say DFS, BFS and backtracking algorithms.We have conducted an extensive study on this problem and realized that no algorithms so far designed with simple formula based.This paper includes a new paradigm which able to compute one unique solutions to the N-queens problem.Again our experimental study brings out a significant outcome.