[SOLVED] prolog CompSci 367/761 ASSIGNMENT 2: TRAVELLING SALESPERSON PROBLEM (TSP) : FINDING OPTIMAL TOUR ADDENDA 2.0 (Updated 12 August 2019)

CompSci 367/761 ASSIGNMENT 2: TRAVELLING SALESPERSON PROBLEM (TSP) : FINDING OPTIMAL TOUR ADDENDA 2.0 (Updated 12 August 2019)
1 INTRODUCTION TO ADDENDA
This document is the addenda to the different parts of the assignment document. The addenda either corrects or clarifies part of the assignment description.
2 ADDENDA FOR PHASE 1 DESCRIPTION
Clarifications:

3
1.
2.
4
1.
page 2, top of page: where SolutionPath is described, the following sen- tence should be added Unlike the input varaible Path, SolutionPath is a list of cities IN THE ORDER they are visited, whereas Path is in the reverse order.
New section
Submission Information
What to submit
You need to submit a file, a2.pl, that ONLY has your prolog code for assignment 2. It should NOT contain any facts that you might have used to test it nor the optimalSolution code.
When and where to submit
You need to submit this to Canvas by 27 August 23:59.
ADDENDA FOR PHASE 2 DESCRIPTION
Correction to negative example
The last example given if:
[(a, [(b,2)])(b, [])] which should be:
[(a, [(b,2)]),(b, [])]. There is a comma missing which needs to be added.
1