Current Slide

Small screen detected. You are viewing the mobile version of SlideWiki. If you wish to edit slides you will need to use a larger device.

Summary

  • Uninformed Search
    • If the branching factor is small, BFS is the best solution
    • If the tree is depth IDS is a good choice
  • Informed Search
    • Heuristic function selection determines the efficiency of the algorithm
    • If actual cost is very expensive to be computed, then Best First Search is a good solution
    • Hill climbing tends to stack in local optimal solutions

Speaker notes:

Content Tools

Sources

There are currently no sources for this slide.