Is eight enough?: the eight queens problem re-examined

Authors:
John S. Gray
Affiliations:
-
Venue:
ACM SIGCSE Bulletin
Year:
1993

Citing 3
Cited 1

Data structures and program design (2nd ed.)

Data structures and program design (2nd ed.)
A polynomial time algorithm for the N-Queens problem

ACM SIGART Bulletin
Algorithms + Data Structures = Programs

Algorithms + Data Structures = Programs

Isomorphism and the N-Queens problem

ACM SIGCSE Bulletin

Quantified Score

Hi-index	0.00

Visualization

Abstract

A detailed analysis of a classic backtracking problem, The Eight Queen Problem is presented. The paper addresses additional facets of the Eight Queen Problem that might be overlooked when casually generating a program solution. The author suggests that the extra time taken to fully analyze the problem will result in a better understanding of the problem which in turn will manifest itself in a better program solution.