IA Caixeiro Viajante

(En) Artificial Intelligence Algorithm - Traveling Salesman Problem. Finite state problem, with exact solution. In each round validates only one level. Search for amplitude. The strategy used builds the path according to the heuristic "go to the nearest unvisited city". Implemented the search for the best choice. It uses lists to keep states open and closed, according to the heuristic estimate of their "proximity". Thus, each loop interaction considers the state most "promising" in the open list. (Pt) Algoritmo de Inteligência Artificial - Problema do Caixeiro Viajante. Problema de estado fini...