COEN 171

Programming Languages

Winter 2000

Second Programming Assignment

Problem Statement: The assignment for this second programming problem is to again implement a recursive solution to the 8 Queens problem, but this time using the functional programming language LISP (or its variant, Scheme).

You will have to adapt the data structures and control structures from your imperative solution to the style of a functional language, but the basic algorithms remain relatively similar.

Hand in complete source listings for your program, as well as the results of execution (output file listings, terminal session logs, etc.) indicating a correct solution to the 8 Queens problem.

Suggestions: Again, you may find it easier to debug your programs using a smaller board (say, 4x4) simply to minimize execution time. In a functional language, it is certainly easier to implement a solution that works for any value of N, and then invoke it with a parameter to solve the 8x8 case.

There is no requirement for graphical (or other two-dimensional) output of your solution. A simple list of (row, column) pairs is sufficient.

Due Date: February 8, 2000