Artificial Intelligence (2014-2015) Tutorial Question Hill Climbing can be applied to a traveling salesman-like problem as follows Each path going through all the cities is viewed as a state and each state transition is performed by switching the order of two cities in a path The heuristic function value of a path is defined as its total length nZ on e co m Consider the city map with four cities A, B, C, and D, and their pairwise distances as in Figure Apply Hill Climbing to look for a shortest possible path that visits each city exactly once (not required to go back to the start city), assuming that the initial path is ABCD, whose total length is + + = Question Si nh V ie Figure shows a start and goal state for the 8-puzzle, along with the first three states generated in the search Figure SinhVienZone.com https://fb.com/sinhvienzonevn Consider heuristics and use Best_First_Search (f(n) = g(n) + h(n)) to solve the problem: h1(n): counts the tiles out of place in each state when compared with the goal h2(n): sum all the distances by which the tiles are out of place, one for each square a tile must be moved to reach its position in the goal state h3(n): multiplies a small number (2, for example) times each direct tile reversal (where two adjacent tiles must be exchanged to be in the order of the goal) ie nZ on e co m Figure summaries of heuristic functions Figure Three heuristics applied to state in the 8-puzzle Si nh V And: g(n): actual distance from n to the start state (Figure 4) Figure SinhVienZone.com https://fb.com/sinhvienzonevn