N-queens problem by efficient non-backtracking algorithm using local search, heuristics and Tabu search elements
Marian Kovac · 2014
This paper presents an efficient algorithm using Local search, various heuristics and Tabu search elements, which is capable to find solution for huge instances of the n-queens (hundreds of millions n). The algorithm returns random solutions in short time even on an ordinary personal computer. There is no other faster algorithm in n-Queens bibliography as our presented algorithm so far.