|
||||
Homework Twoout 9/9, due 9/18This homework will give you experience with solving problems using uninformed search techniques. Write code to solve the following two classic search problems using a programming language and search technique of your choice.
What to turn in: For the knight's tour, turn in a tour for an 8x8 chess board and the tour for the largest board you are able to solve (along with the value of N for that board). For the cryptarithmetic problem, turn in the output of your program for any 3 examples (you can find many of them online). The above should be handed in during class on the due date on paper. Also, submit your code via blackboard along with a README on how to run it. Your code must run on a GL machine. In the README tell us what GL machine you tested it on. Make it easy to run your code because if we cannot get it to work we cannot grade it. Please submit your code as a single tar file. Do not use anything other than tar to bundle the files. You may compress the tar file as long as the file extension makes it clear what compression tool you used. To turn in your code via blackboard, click on the Assignments link and then click on Homework 2.
|