Algorithmic Approaches for the N-Queen Problem: L and T Shape Traversal vs. Boolean Attack Arrays

Author(s)	Khushboo Kumari, Saravanan K N, Ramamurthy B
Country	India
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
Keywords	N-Queens Problem, Backtracking Optimization, Boolean Attack Arrays, L and T Shape Traversal, Combinatorial Optimization, Constraint Satisfaction
Field	Computer
Published In	Volume 8, Issue 1, January-February 2026
Published On	2026-02-04
DOI	https://doi.org/10.36948/ijfmr.2026.v08i01.65567

About IJFMR Fees & Payment Current Issue Publication Archive	Submit Research Paper Track Submission Status Publication Guidelines Publication Ethics Peer Review & Plagiarism	Join as a Reviewer Editors & Reviewers Reviewer Referral Program Get Reviewer Membership Certi.	Website/Journal Policies Usage Policy Content Policies Privacy Policy

Contact Us		+91-9687-828-838	editor@ijfmr.com

International Journal For Multidisciplinary Research