Algorithmic Approaches for the N-Queen Problem: L and T Shape Traversal vs. Boolean Attack Arrays
Abstract
This paper compares two optimized backtracking approaches for solving the N-Queens problem: the L and T shape attack propagation method and the Boolean attack arrays method. The L and T method reduces redundant conflict checks by explicitly marking attacked cells, while the Boolean arrays method enables constant-time safety checks using column and diagonal tracking. Experimental results show that both outperform traditional backtracking, with the Boolean arrays method achieving the highest efficiency as board size increases
Fields of Study & Subjects
Constraint Satisfaction and Optimization
Artificial Intelligence in Games
Metaheuristic Optimization Algorithms Research
Publication details
- Journal / source
- International Journal For Multidisciplinary Research
- Volume
- 8
- Issue
- 1
- Publication date
- 4 February 2026