hw7-fig - n < 10 existed in Wonderland, and...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
CS 325 Due: Friday 19 Nov Homework #7 Searching in Wonderland In Wonderland, there are n × n chessboards. For each such chessboard there are n queens each of whom sits proudly on her square so that when she looks down her row, her column, or her diagonals she can see no other queen. Alice’s assignment was to find out how many such boards of each size there were in all of Wonderland. While she was searching for the chessboards, Alice met the White Knight who told her that there was no need to roam about because he had discovered that no two boards were rotations or reflections of one another, and except for these restrictions and the restrictions on the placement of the queens, all possible boards with
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

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.

Ask a homework question - tutors are online