1. This is the map of UUM Main Campus (Sintok) to show related distances (in kilometres)...

Transcribed Image Text:

1. This is the map of UUM Main Campus (Sintok) to show related distances (in kilometres) from the Main Gate to the Varsity Mall. Main Gate TISSA [1.5] Anjung Tamu 12.51 INASIS Tradewinds [0.3] [0.5] 10.31 [0.5] Library Varsity Mall [0.8] G10.61- Mosque 10.21 [0.8] [0.5] [0.1]- Great Hall Soc Health Centre [0.6] [1.5] Sport Centre INASIS Maybank 10.3]- First, convert this labelled directed graph into a search tree representation. Next, you need to define your heuristic function for each node. Later, find the searching space from the Main Gate (start) to the Varsity Mall (goal) for the following search methods: a) Depth-First Search b) Breadth-First Search c) Depth Limited Search (L = 3) d) Uniform Cost Search e) Best First (Greedy) Search f) A* Algorithm Report all visited nodes, expanded nodes, and cost (if applicable). Using Big O(n) notation and the results, decide which algorithm is the best and why. Note: You must design your heuristic function for any heuristic / informed search. Explain how you choose the method. Play with your unlimited creativity. 1. This is the map of UUM Main Campus (Sintok) to show related distances (in kilometres) from the Main Gate to the Varsity Mall. Main Gate TISSA [1.5] Anjung Tamu 12.51 INASIS Tradewinds [0.3] [0.5] 10.31 [0.5] Library Varsity Mall [0.8] G10.61- Mosque 10.21 [0.8] [0.5] [0.1]- Great Hall Soc Health Centre [0.6] [1.5] Sport Centre INASIS Maybank 10.3]- First, convert this labelled directed graph into a search tree representation. Next, you need to define your heuristic function for each node. Later, find the searching space from the Main Gate (start) to the Varsity Mall (goal) for the following search methods: a) Depth-First Search b) Breadth-First Search c) Depth Limited Search (L = 3) d) Uniform Cost Search e) Best First (Greedy) Search f) A* Algorithm Report all visited nodes, expanded nodes, and cost (if applicable). Using Big O(n) notation and the results, decide which algorithm is the best and why. Note: You must design your heuristic function for any heuristic / informed search. Explain how you choose the method. Play with your unlimited creativity.