The 8 Queens Problem: A Backtracking Approach
The 8 queens problem is a classic chess challenge that involves positioning 8 queens on an 8 × 8 board such that no queen attacks another. In this article, we thoroughly explore this problem, discussing its formulation, its relevance in search algorithm studies, and present a practical implementation based on the backtracking technique. The problem serves as an excellent didactic example in computer science courses.
Institutions
- Universidade da Região de Joinville (BR)
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2025-05-02
- DOI
- https://doi.org/10.5281/zenodo.15321090
- Primary Topic
- Artificial Intelligence in Games
- Type
- article
- Field-Weighted Citation Impact
- 0.00