- I have received various questions on the second part of the Lisp assignment on computing mean and standard deviation on the three maps for the TSP problem.
I suggest that you read the code for the function compare-search-algorithm in search/algorithms/problems.lisp to see how the function gets the solution of each problem, and extracts from it the path-length and g-cost to compute the averages.
You can then write your own function to do something similar for the three maps you have to use.
A standard rule when given already written code, like the AIMA software, is not to modify the code given but to add to it by writing the changes/additions in a new file. So to modify an existing function you should redefine it in a new file and load your new file after you load the AIMA software. This way the original software is not changed, and your modifications and new software are in your own file. If a function is redefined the order of loading the files affects which function is used. When you submit your assignment you will have to submit just your own file.
Posted from Diigo. The rest of my favorite links are here.
