Isomorphism and the N-Queens problem-Reference-Cited by-同舟云学术

Isomorphism and the N-Queens problem

Published:1994-09 Issue:3 Volume:26 Page:29-36
ISSN:0097-8418
Container-title:ACM SIGCSE Bulletin
language:en
Short-container-title:SIGCSE Bull.

Author:

Cull Paul¹,Pandey Rajeev¹

Affiliation:

1. Department of Computer Science, Oregon State University, Corvallis, Oregon

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.

Publisher

Association for Computing Machinery (ACM)

Link

https://dl.acm.org/doi/pdf/10.1145/187387.187400

Reference28 articles.

1. Divide and conquer under global constraints: A solution to the N-queens problem

2. Teaching tools for data structures and algorithms

3. Backtrack programming techniques

4. The n-queens problem

5. Independent permutations, as related to a problem of Moser and a theorem of Pólya

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. An Orbit-Based Search Algorithm to Solve N-Queens Problem;Applied Mechanics and Materials;2012-08

2. Optimization of N-Queens Solvers on Graphics Processors;Lecture Notes in Computer Science;2011

3. A survey of known results and research areas for n-queens;Discrete Mathematics;2009-01

4. Optimization via Intermittency with a Self-Organizing Neural Network;Neural Computation;2005-11-01

5. Graph Isomorphism Algorithm by Perfect Matching;IFIP Advances in Information and Communication Technology;2003