Isomorphism and the N-Queens problem

Authors:
Paul Cull;Rajeev Pandey
Affiliations:
Department of Computer Science, Oregon State University, Corvallis, Oregon;Department of Computer Science, Oregon State University, Corvallis, Oregon
Venue:
ACM SIGCSE Bulletin
Year:
1994

Citing 17
Cited 4

On the diagonal queens domination problem

Journal of Combinatorial Theory Series A
A note on the queens' problem

Information Processing Letters
Solutions to the n Queens problem using tasking in Ada

ACM SIGPLAN Notices
Solving the “N

ACM SIGPLAN Notices
A simplified solution of the n queens` problem

Information Processing Letters
Efficient search techniques—an empirical study of the N-Queens problem

IBM Journal of Research and Development
Divide and conquer under global constraints: a solution to the N-queens problem

Journal of Parallel and Distributed Computing
An almost perfect heuristic for the N nonattacking queens problem

Information Processing Letters
A polynomial time algorithm for the N-Queens problem

ACM SIGART Bulletin
Machine independent parallel execution of speculative computations

Machine independent parallel execution of speculative computations
Teaching tools for data structures and algorithms

ACM SIGCSE Bulletin
Hopfield networks, neural data structures and the nine flies problem: neural network programming projects for undergraduates

ACM SIGCSE Bulletin
Is eight enough?: the eight queens problem re-examined

ACM SIGCSE Bulletin
Backtrack programming techniques

Communications of the ACM
Program development by stepwise refinement

Communications of the ACM
A new solution to the N

ACM SIGPLAN Notices
Fundamentals of Computer Alori

Fundamentals of Computer Alori

A self-organising neural network with intermittent switching dynamics for combinatorial optimisation

Design and application of hybrid intelligent systems
Optimization via Intermittency with a Self-Organizing Neural Network

Neural Computation
Optimization of N-queens solvers on graphics processors

APPT'11 Proceedings of the 9th international conference on Advanced parallel processing technologies
A linear solution to the n-Queens problem using vector spaces

Journal of Computing Sciences in Colleges

Quantified Score

Hi-index	0.00

Visualization

Abstract

The N-Queens problem is commonly used to teach the programming technique of backtrack search. The N-Queens problem may also be used to illustrate the important concept of isomorphism. Here we show how the N-Queens problem can be used as a vehicle to teach the concepts of isomorphism, transformation groups or generators, and equivalence classes. We indicate how these ideas can be used in a programming exercise. We include a bibliography of 29 papers.