skip to main content
article
Free Access

Isomorphism and the N-Queens problem

Authors Info & Claims
Published:01 September 1994Publication History
Skip Abstract Section

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.

References

  1. [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 ScholarGoogle ScholarDigital LibraryDigital Library
  2. [Bie93] Biernat, Martin J., "Teaching Tools for Data Structures and Algorithms," SIGCSE Bulletin, 25(4):9-12 (December 1993). Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. [BiR75] Bitner, James R., and Reingold, Edward M., "Backtrack Programming Techniques," Communications of the ACM, 18(11): 651-656 (November 1975). Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. [BrD75] Bruen, A., and Dixon, R., "The n-Queens Problem," Discrete Mathematics, 12:393-395 (1975).Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. [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 ScholarGoogle ScholarCross RefCross Ref
  6. [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 ScholarGoogle ScholarDigital LibraryDigital Library
  7. [Cla86] Clay, C., "A New Solution to the N ¿ 8 Queens Problem," SIGPLAN Notices, 21(12):28-30 (August 1986). Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. [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 ScholarGoogle ScholarDigital LibraryDigital Library
  9. [CuD78] Cull, Paul, and De Curtins, J., "Knight's Tour Revisited," Fibonacci Quarterly, 16, 276-285 (1978).Google ScholarGoogle Scholar
  10. [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 ScholarGoogle Scholar
  11. [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 ScholarGoogle Scholar
  12. [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 ScholarGoogle Scholar
  13. [FaS90] Falkowski, Bernd-Jürgen and Schmitz, Lothar, "A Note on the Queens' Problem," Information Processing Letters, 23:39-46 (July 1986). Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. [Go187] Goldsby, Michael E., "Solving the "N ¿ 8 Queens" Problem with CSP and Modula-2," SIGPLAN Notices, 22(2):43-52 (February 1987). Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. [Gra93] Gray, John S., "Is Eight Enough? - The Eight Queens Problem Re-examined," SIGCSE Bulletin, 25(3):39-44, 51 (September 1993). Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. [HaV73] Hansche, Brian, and Vucenic, Wayne, "On the n-queens problem," (abstract) Notices of the American Mathematical Society, 20:A-568 (1973).Google ScholarGoogle Scholar
  17. [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 ScholarGoogle Scholar
  18. [HoS78] Horowitz, E., and Sahni, S., Fundamentals of Computer Algorithms, Computer Science Press, Rockville, Maryland (1978). Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. [Kal90] Kalé, L.V., "An Almost Perfect Heuristic for the N Nonattacking Queens Problem," Information Processing Letters, 34:173-178 (April 1990). Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. [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 ScholarGoogle ScholarDigital LibraryDigital Library
  21. [Kla67] Klarner, D. A., "The Problem of Reflecting Queens," American Mathematical Monthly, 74:953-955 (1967).Google ScholarGoogle Scholar
  22. [MaM92] Mandziuk, Jacek, and Macukow, Bohdan, "A neural network designed to solve the N-Queens Problem," Biological Cybernetics, 66:375-379 (1992).Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. [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 ScholarGoogle Scholar
  24. [Rei87] Reichling, Matthias, "A Simplified Solution of the N Queens' Problem," Information Processing Letters, 25:253-255 (June 1987). Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. [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 ScholarGoogle ScholarDigital LibraryDigital Library
  26. [Seb69] Sebastian, J. D., "Some Computer Solutions to the Reflecting Queens Problem," American Mathematical Monthly, 76:399-400 (1969).Google ScholarGoogle ScholarCross RefCross Ref
  27. [SoG90] Sosic, Rok, and Gu, Jun, "A Polynomial Time Algorithm for the N-Queens Problem," SIGART Bulletin, 1(3):7-11 (October 1990). Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. [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 ScholarGoogle ScholarDigital LibraryDigital Library
  29. [Wir71] Wirth, Niklaus, "Program Development by Stepwise Refinement," Communications of the ACM, 14(4):221-227 (April 1971). Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Isomorphism and the N-Queens problem

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in

        Full Access

        • Published in

          cover image ACM SIGCSE Bulletin
          ACM SIGCSE Bulletin  Volume 26, Issue 3
          Sept. 1994
          67 pages
          ISSN:0097-8418
          DOI:10.1145/187387
          Issue’s Table of Contents

          Copyright © 1994 Authors

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 1 September 1994

          Check for updates

          Qualifiers

          • article

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader
        About Cookies On This Site

        We use cookies to ensure that we give you the best experience on our website.

        Learn more

        Got it!