TRƯỜNG ĐẠI HỌC BÁCH KHOA TP.HCM Khoa Khoa học & Kỹ thuật Máy tính ARTIFICIAL INTELLIGENCE Tut - Search Space and Strategies ie nZ on e co m Question nh V Figure – A road map of Romania Si Figure gives a simplified road map of Romania Find a path from Bucharest to Timisoara using Depth-First-Search and Breadth-First-Search Assume that when performing the BFS traversal, the cities will be considered in counter-alphabetical order when in the same level Question For each of the following problems, specify (i) a representation for a state; (ii) the start and goal states and (iii) the operators, each of which is followed by an example Example problem: The water-jug problem in the lecture notes State representation: a pair (x,y) where xand yare respectively the amounts of water in 4-litre and 3-litre jugs Start state:(0,0) Goal state:(2,n) 0