Title: A Fast Search Algorithm for N-Queens Problem
Abstract: The backtracking algorithm is the classical algorithm for solving N queens problem.In the worst case,a backtracking algorithm is exponential with N,so it is not able to meet the requirements of the encoding scheme for Q-matrix LDPC code.In this paper,a fast search algorithm,which is probabilistic local search with conflict minimization is presented,the performance of this algorithm is more better than backtracking algorithm,it runs almost in linear time with N,and it is very flexible,so it's more appropriate for the encoding scheme for Q-matrix LDPC code.
Publication Year: 2009
Publication Date: 2009-01-01
Language: en
Type: article
Access and Citation
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot