Track: High School STEM Competition
Abstract
The century old problem of configuring n queens on a chessboard so that none of them attack one another, known as the “n-queens problem”, has been studied intensively by researchers, along with many variants. To this day, the problem stands as a prominent example for backtracking search methods. Its demonstration of constraint satisfaction, as well as systematic and heuristic search methods, highlights its utility in fields such as artificial intelligence (AI) and program development. This paper focuses on a contemporary variant, the “mod 2 n-queens problem”, recently proposed by Brown and Ladha. This paper uses graph theory to solve some of the open problems Brown and Ladha posed.