Uninformed and heuristic search/ AIMA java Classes
The goal of this session is to get acquainted with the java classes that implement some search algorithms (uninformed, heuristic and local search)
This classes allow to separate the description of the problem from the search algorithms.
It is important that you have a copy of the source code on your local area to inspect the code and to run the examples.
You can try also the different parameters of the algorithms (mainly
for the heuristic search algorithms) to see how they affect the results.
You can run the Travel Salesman Problem (TSP)
(IA.probTSP) and the mobile antennas problem (IA.probAntenas)