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.
- [AbY89] Abramson, Bruce, and Yung, Moti, "Divide and Conquer under Global Constraints: A Solution to the N-Queens Problem," Journal of Parallel and Distributed Computing, 6: 649-662 (1989). Google Scholar
Digital Library
- [Bie93] Biernat, Martin J., "Teaching Tools for Data Structures and Algorithms," SIGCSE Bulletin, 25(4):9-12 (December 1993). Google Scholar
Digital Library
- [BiR75] Bitner, James R., and Reingold, Edward M., "Backtrack Programming Techniques," Communications of the ACM, 18(11): 651-656 (November 1975). Google Scholar
Digital Library
- [BrD75] Bruen, A., and Dixon, R., "The n-Queens Problem," Discrete Mathematics, 12:393-395 (1975).Google Scholar
Digital Library
- [Cha74] Chandra, A. K., "Independent Permutations as Related to a Problem of Moser and a Theorem of Pólya," J. Combin. Theory, 16(1):111-120 (January 1974).Google Scholar
Cross Ref
- [CMV86] Clapp, Russell M., Mudge, Trevor N., and Volz, Richard A., "Solutions to the n Queens Problem Using Tasking in Ada," SIGPLAN Notices, 21(12):99-110 (Decemeber 1986). Google Scholar
Digital Library
- [Cla86] Clay, C., "A New Solution to the N ¿ 8 Queens Problem," SIGPLAN Notices, 21(12):28-30 (August 1986). Google Scholar
Digital Library
- [CoH86] Cockayne, E. J., and Hedetniemi, S. T., "On the Diagonal Queens Domination Problem," Journal of Combinatorial Theory, Series A 42, 137-139 (1986). Google Scholar
Digital Library
- [CuD78] Cull, Paul, and De Curtins, J., "Knight's Tour Revisited," Fibonacci Quarterly, 16, 276-285 (1978).Google Scholar
- [DeT91] Demirors, O., and Tanik, M. M., "Peaceful Queens and Magic Squares," Technical Report 91-CSE- 7, Department of Computer Science and Engineering, Southern Methodist University, Dallas, TX 75275-0122 (February 1991).Google Scholar
- [ErT91] Erbas, Cengiz, and Tanik, Murat M., "N-Queens Problem and its Algorithms," Technical Report 91-CSE-8, Department of Computer Science and Engineering, Southern Methodist University, Dallas, TX 75275-0122 (February 1991).Google Scholar
- [ETA92] Erbas, Cengiz, Tanik, Murat M. and Aliyazicioglu, Zekeriya, "A Note on Falkowski's N-Queens Solutions," Technical Report 92-CSE-14, Department of Computer Science and Engineering, Southern Methodist University, Dallas, TX 75275-0122 (May 1992).Google Scholar
- [FaS90] Falkowski, Bernd-Jürgen and Schmitz, Lothar, "A Note on the Queens' Problem," Information Processing Letters, 23:39-46 (July 1986). Google Scholar
Digital Library
- [Go187] Goldsby, Michael E., "Solving the "N ¿ 8 Queens" Problem with CSP and Modula-2," SIGPLAN Notices, 22(2):43-52 (February 1987). Google Scholar
Digital Library
- [Gra93] Gray, John S., "Is Eight Enough? - The Eight Queens Problem Re-examined," SIGCSE Bulletin, 25(3):39-44, 51 (September 1993). Google Scholar
Digital Library
- [HaV73] Hansche, Brian, and Vucenic, Wayne, "On the n-queens problem," (abstract) Notices of the American Mathematical Society, 20:A-568 (1973).Google Scholar
- [HLM69] Hoffman, E.J., Loessi, J.C., and Moore, R.C., "Constructions for the Solution of the m Queens Problem," National Mathematics Magazine, 66-72 (March-April 1969).Google Scholar
- [HoS78] Horowitz, E., and Sahni, S., Fundamentals of Computer Algorithms, Computer Science Press, Rockville, Maryland (1978). Google Scholar
Digital Library
- [Kal90] Kalé, L.V., "An Almost Perfect Heuristic for the N Nonattacking Queens Problem," Information Processing Letters, 34:173-178 (April 1990). Google Scholar
Digital Library
- [Kea93] Keating, John G., "Hopfield Networks, Neural Data Structures and the Nine Flies Problem: Neural Network Programming Projects for Undergraduates," SIGCSE Bulletin, 25(4):33-37, 40,60 (December 1993). Google Scholar
Digital Library
- [Kla67] Klarner, D. A., "The Problem of Reflecting Queens," American Mathematical Monthly, 74:953-955 (1967).Google Scholar
- [MaM92] Mandziuk, Jacek, and Macukow, Bohdan, "A neural network designed to solve the N-Queens Problem," Biological Cybernetics, 66:375-379 (1992).Google Scholar
Digital Library
- [Pol18] Pólya, G., "Uber die 'doppelt-periodischen' Losungen des n-Damen-Problems," In Ahrens, W. (Ed.), Mathematische Unterhaltungen and Spiele. Teubner, Leipzig, pp. 364-374 (1918).Google Scholar
- [Rei87] Reichling, Matthias, "A Simplified Solution of the N Queens' Problem," Information Processing Letters, 25:253-255 (June 1987). Google Scholar
Digital Library
- [Sal90] Saletore, Vikram A., "Machine Independent Parallel Execution of Speculative Computation," PhD Thesis, Department of Computer Science, University of Illinois, Urbana-Champaign (September 1990). Google Scholar
Digital Library
- [Seb69] Sebastian, J. D., "Some Computer Solutions to the Reflecting Queens Problem," American Mathematical Monthly, 76:399-400 (1969).Google Scholar
Cross Ref
- [SoG90] Sosic, Rok, and Gu, Jun, "A Polynomial Time Algorithm for the N-Queens Problem," SIGART Bulletin, 1(3):7-11 (October 1990). Google Scholar
Digital Library
- [StS87] Stone, Harold S., and Stone, Janice M., "Efficient Search techniques-An empirical study of the N-Queens Problem," IBM Journal of Research and Development, 31(4):464-474 (July 1987). Google Scholar
Digital Library
- [Wir71] Wirth, Niklaus, "Program Development by Stepwise Refinement," Communications of the ACM, 14(4):221-227 (April 1971). Google Scholar
Digital Library
Index Terms
Isomorphism and the N-Queens problem
Recommendations
On the isomorphism problem of concept algebras
Weakly dicomplemented lattices are bounded lattices equipped with two unary operations to encode a negation on concepts. They have been introduced to capture the equational theory of concept algebras (Wille 2000; Kwuida 2004). They generalize Boolean ...






Comments