The n-queens problem is to find the different ways to assign n non-attacking queens in a nxn chessboard. This work analyzes the application of an algorithm based on Local Search for the resolution of the n-queens problem.
Empirical results show that, large size instances of the problem are well solved by the Local Search algorithm in comparison to more sophisticated algorithms like Genetic Algorithms.