[SOLVED] prolog network CompSci 367/761 ASSIGNMENT 2: TRAVELLING SALESPERSON PROBLEM (TSP) : FINDING OPTIMAL TOUR

CompSci 367/761 ASSIGNMENT 2: TRAVELLING SALESPERSON PROBLEM (TSP) : FINDING OPTIMAL TOUR
Phase 3: Optimal Solution wrapper
1 Introduction
The file optimalSolution.pl contains the optimalSolution(+StartCity, +Road- Network, -OptimalCost, -Solution) predicate, which uses the solution/4 pred- icate, that you have written, to find an optimal solution to the given start city/road network combination. You can use this wrapper predicate to test out whether the optimal solution is among the solutions that your solution/4 pred- icate can find. It doesnt really affect your assignment at all as you are simply asked to write prolog code to find solutions (i.e., the solution/4 code).
It has mainly been provided because the normal goal of travelling salesman problems is to find the minimal path. This wrapper allows your code to be used to solve this problem.
1