Isomorphism and the N-Queens Proble m Paul Cul l Rajeev Pandey Department of Computer Scienc e Oregon State Universit y Corvallis, Orego n 97331 320 2 {pc, rpandey}©cs .orst .edu 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 . Her e 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 use d in a programming exercise . We include a bibliography of 29 papers . 1 Introductio n The 8-Queens problem [Wir7l] or the more general N-Queens problem is often used to explicate backtrackin g in computing courses . A recent paper by Gray [Gra93] presents a detailed analysis of the N-Queens problem , and how fully analyzing the problem can lead to better solutions . In this note, we want to point out tha t N-Queens can also be used as a vehicle for teaching the ideas of isomorphism and transformation groups . We have successfully presented the following material
/lp/association-for-computing-machinery/isomorphism-and-the-n-queens-problem-0pJ0300nmm