This preview shows page 1. Sign up to view the full content.
Unformatted text preview: n < 10 existed in Wonderland, and since there were only a nite number of such boards, he was able to calculate the number of chessboards in Wonderland. Unfortunately he had misplaced his calculations while attending a tea party. Your assignment is to write a computer program which carries out the Knights calculations and nds all of the nonisomorphic legal placements of n queens on an n n chessboard. You will run your program for n = 1 through 9, report one member of each isomorphism class, and discover the total number of chessboards in Wonderland. Prepare a nice report to give to the White Knight (Our TA) ....
View
Full
Document
This note was uploaded on 12/04/2010 for the course CS 325 taught by Professor Staff during the Fall '08 term at Oregon State.
 Fall '08
 Staff
 Algorithms

Click to edit the document details