CSC352 Homework 2

This assignment is due on 2/18/10.

Problem #1

Take the multiprocessing version of the N-Queens program and fix it. It is currently inefficient, as we saw in class. In particular, it does not need the foundOne boolean, and it has to wait for all the child processes to finish before it can finish executing. Instead, change the code so that all the processes are "told" to stop when one solution is found. This way the parent process will not have to wait around.

Once your program works, measure its "best of four runs" execution time and plot it for N=10 to 25. In other words, run it 4 times for N=10, and keep the best time. 4 times for N=11 and keep the best time, etc.

You may find the following page useful for generating the list of best times.