Slide Set 2: State-Space Search 24
ICS 271, Fall 2007: Professor Padhraic Smyth
The Traveling Salesperson Problem
Find the shortest tour that visits all cities without visiting any city twice and return to starting point.
State: sequence of cities visited
S0 = A
G = a complete tour