1 / 10

Approaches to search

Approaches to search. Simple search Depth-first search Breadth-first search Heuristic search Hill-climbing Best-first search Branch-and-bound search A* Genetic search Adversarial search. B. C. D. A. E. G. H. I. Depth-first search. A. . B. C. D. A. E. F. B. G. H. I.

henry
Download Presentation

Approaches to search

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. Approaches to search • Simple search • Depth-first search • Breadth-first search • Heuristic search • Hill-climbing • Best-first search • Branch-and-bound search • A* • Genetic search • Adversarial search Search

  2. B C D A E G H I Depth-first search A  Search

  3. B C D A E F B G H I J K L Breadth-first search A Search

  4. B C 15? 16? D A E F B 18? 17? 13? 15? G H I J K 12? 8? 14? 2? Hill-climbing A 20? Search

  5. B C 15? 16? D A E F B 18? 17? 13? 15? J K 8? 2? Best-first search A 20? Search

  6. B C 1 4 2 4 3 D A F G H 5 9 7 9 I J K L M 9 10 Branch-and-bound search A 6 7 8 Search

  7. B C >5 1 >3 4 2 4 3 C D E >3 >4 >3 8 9 H I J 0 >1 A* A >5  7 0 Search

  8. I J K L M N O P Q R S T U V W X Genetic search A B C D E F G H Search

  9. 5 4 9 2 1 9 4 2 6 5 3 9 3 2 3 Adversarial search: minimax maximizing 6 minimizing 5 6 3 maximizing 5 9 9 6 5 9 3 Search

  10. maximizing minimizing maximizing 5 4 1 9 4 2 6 5 3 Adversarial search:minimax + alpha-beta ≥5 ≥6 6 ≤5 6 ≤5 5 5 ≥9 9 6 5 9 Search

More Related