{"id":220,"date":"2017-08-31T20:46:42","date_gmt":"2017-08-31T20:46:42","guid":{"rendered":"https:\/\/my.dev.vanderbilt.edu\/cs4260cs5260\/?page_id=220"},"modified":"2017-08-31T22:37:18","modified_gmt":"2017-08-31T22:37:18","slug":"assignment-a-w2","status":"publish","type":"page","link":"https:\/\/my.dev.vanderbilt.edu\/cs4260cs5260\/assignment-a-w2\/","title":{"rendered":"Assignment A-w2"},"content":{"rendered":"<p>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 F, K, and L are goals. Leaf states\/nodes have no successors.<\/p>\n<p><a href=\"https:\/\/my.dev.vanderbilt.edu\/cs4260cs5260\/assignment-a-w2\/slide2\/\" rel=\"attachment wp-att-221\"><img loading=\"lazy\" decoding=\"async\" class=\"aligncenter size-full wp-image-221\" src=\"https:\/\/cdn-dev.vanderbilt.edu\/t2-my-dev\/wp-content\/uploads\/sites\/2495\/2017\/08\/Slide2.jpg\" alt=\"Slide2\" width=\"657\" height=\"331\" \/><\/a><br \/>\nGive the order in which nodes are visited (i.e., checked for goalness) by each of the following search strategies. <strong>In the case of two or more nodes with the same evaluation score on the frontier, break the tie by visiting the nodes from left-to-right as the nodes appear in the graph above.<\/strong> Also answer the admissibility question. Submit all answers (clearly labeled a-f, and with the name of the search strategy) as a PDF file on Brightspace in the A-w2 submission folder.<\/p>\n<p>a) Lowest-Cost-First Search:<br \/>\nb) Heuristic Depth-First Search:<br \/>\nc) Greedy Best-First Search:<br \/>\nd) A*:<\/p>\n<p>e) Is the heuristic admissible?<\/p>\n","protected":false},"excerpt":{"rendered":"<p>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 F, K, and &hellip; <a href=\"https:\/\/my.dev.vanderbilt.edu\/cs4260cs5260\/assignment-a-w2\/\">Continue reading <span class=\"meta-nav\">&rarr;<\/span><\/a><\/p>\n","protected":false},"author":633,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-220","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/my.dev.vanderbilt.edu\/cs4260cs5260\/wp-json\/wp\/v2\/pages\/220","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/my.dev.vanderbilt.edu\/cs4260cs5260\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/my.dev.vanderbilt.edu\/cs4260cs5260\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/my.dev.vanderbilt.edu\/cs4260cs5260\/wp-json\/wp\/v2\/users\/633"}],"replies":[{"embeddable":true,"href":"https:\/\/my.dev.vanderbilt.edu\/cs4260cs5260\/wp-json\/wp\/v2\/comments?post=220"}],"version-history":[{"count":4,"href":"https:\/\/my.dev.vanderbilt.edu\/cs4260cs5260\/wp-json\/wp\/v2\/pages\/220\/revisions"}],"predecessor-version":[{"id":226,"href":"https:\/\/my.dev.vanderbilt.edu\/cs4260cs5260\/wp-json\/wp\/v2\/pages\/220\/revisions\/226"}],"wp:attachment":[{"href":"https:\/\/my.dev.vanderbilt.edu\/cs4260cs5260\/wp-json\/wp\/v2\/media?parent=220"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}