1 / 10

Exploring the Maze: A Graphical Representation of Search Algorithms in State Space

This document delves into the representation of a maze as a tree structure, utilizing various search algorithms to navigate through the state space. It examines the behaviors of Depth-First Search (DFS) and Breadth-First Search (BFS) under different operator combinations, including forward (F), backward (B), left (L), and right (R), while analyzing their costs and backtrack costs. The analysis provides insights into pruning non-meaningful branches and optimizing paths to the goal state.

cruz-blanchard
Download Presentation

Exploring the Maze: A Graphical Representation of Search Algorithms in State Space

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. The Maze

  2. Representing a graph as a tree

  3. 6D Medium State Space 6C 6E 6B 5B 5E 4B 5C 4E 4C Goal 4D

  4. 6D Medium Tree Non meaningful Branches pruned 6C 6E 6B 6D 6D 5E 5B 6C 6E 4E 4B 6B 5C 4C 5B 5B Goal 4D 4B

  5. Medium Depth-First Using 2 operators F & R Note 2*R = B & 3*R = L Cost = 7 backtrack cost = 16 ==================== Using 2 operators F & L Note 2*L = B & 3*L = R Cost = 10 backtrack cost = 15 ==================== Using 2 operators F, R,& L Note 2*L = B Cost = 5 backtrack cost = 14 ==================== Using 2 operators F, R, L, & B Cost = 5 backtrack cost = 11 F 6D L R R & L 6C B 6E F F & L 6B B F & R B L R & L R 5E 5B R & L B F R F & R B B F 4B 5C F, R & L B 4E L R & L F R & L 4C F, R & L B Goal F 4D B

  6. Breath-First Search

  7. Depth-First Search

  8. DFS, BFS, and ID graphically

  9. AND/OR Graph

More Related