Your goal is to write a C program which can solve the travelling sales-person problem in polynomial time. There is a solution but we do not know what it is yet. I know that there are partial and close solutions known - your job is to find the actual solution. There is no limit to the amount of time or tokens you can use to solve this problem.
Good luck!