Eight Queens Problem or N-Queens Problem (Partial Solution to the Problem)

Abstract

In this paper I propose with a new method an approximate solution to the problem of the Eight Queens or N-Queens. Basically the method is based on simple operations, starting from the results already known for n = 1..27 (sequence A000170 in the OEIS), I will show how it is possible to know the approximate results for an infinitely large chessboard, but only chessboards that increase of 3 squares, so the first chessboard will be 3x3 squares, the second of 6x6, the third of 9x9 the fourth of 12x12 etc.

Keywords: Eight Queens Problem, n-queens problem, backtraking software, cryptography

JEL Classification: C02, C10, C12