Professional Documents
Culture Documents
• A Classical problem in AI
– Because it’s very hard (NP-hard)
• The complexity of a exhaustive search if TSP is
O(n!)
– I.e., the time it takes to search all
combinations increases exponentially with the
number of cities (n)
TSP with Ants