1 / 1

CS 260 Search Exercise

CS 260 Search Exercise. (IDDFS: A | A B C D | A B E F C G H D I J K | A B E F L ). Consider the search graph below. The h value of a node is given adjacent to that node. The actual cost of traversing

saddam
Télécharger la présentation

CS 260 Search Exercise

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. CS 260 Search Exercise (IDDFS: A | A B C D | A B E F C G H D I J K | A B E F L ) Consider the search graph below. The h value of a node is given adjacent to that node. The actual cost of traversing an arc is given adjacent to that arc.Node A is the start/initial state. Nodes L and M are goals. Leaf states/nodes have no successors. A 5 5 3 4 B C D 3 4 2 3 4 2 1 2 4 1 E F H I J K G 3 1 3 2 1 1 3 6 6 5 1 5 L M 0 0 Give the order in which nodes are visited (i.e., checked for goalness) by each of the following search strategies. In the case of two or more nodes with the same evaluation score on the FRONTIER (priority queue), break the tie by expanding/goal-checking the nodes from left-to-right as the nodes appear in the graph above. Least-cost first search: A D C J B I E G K H F M Heuristic depth-first search: A D J K I M (what about least-cost DFS, or total-estimated-cost DFS?) Best-first Search: A D J K B E F L A* Search: A D J B E C G I K H M (is the heuristic admissible ?) IDDFS: A | A B C D | A B E F C G H D I J K | A B E F L

More Related