A polynomial time algorithm for the N-Queens problem
ACM SIGART Bulletin
Isomorphism and the N-Queens problem
ACM SIGCSE Bulletin
Hi-index | 0.00 |
This paper presents an approach to solving the n-Queens Problem using vector spaces. Although the situations in which this approach can be used are limited, it shows promise for wider generalization, or as an intermediate step that yields a partial solution. This paper provides an overview of the use of finite fields for generating solutions, presents several examples, gives consideration to the limitations of the proposed methodology, and then shows how it can be combined with other methodologies to quickly produce solutions to the n-Queens Problem.