A Polynomial Time Algorithm for the N-Queens Problem

Abstract

this paper we present a new, probabilistic local search algorithm which is based on a gradient-based heuristic. This efficient algorithm is capable of finding a solution for extremely large size n-queens problems. We give the execution statistics for this algorithm with n up to 500,000. Keywords: Artificial intelligence (AI), combinatorial search, gradient-based heuristic, local search, the n-queens problem, nonbacktracking search, fast search algorithm.