Accès libre

An alternative algorithm for the n–Queens puzzle

À propos de cet article

Citez

In this paper a new method for solving the problem of placing n queens on a n×n chessboard such that no two queens directly threaten one another and considering that several immovable queens are already occupying established positions on the board is presented. At first, it is applied to the 8–Queens puzzle on a classical chessboard and finally to the n Queens completion puzzle. Furthermore, this method allows finding repetitive patterns of solutions for any n.

eISSN:
2182-1976
Langue:
Anglais
Périodicité:
2 fois par an
Sujets de la revue:
Mathematics, General Mathematics