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.
Search Methods are typically helping humans to solve complex tasks by generating (optimal) plans (i.e. a set of operations / states) that includes sequences / actions to reach a goal state.
Example problem: Tower of Hanoi
Initial status: ((123)()())
Goal status: (()()(123))
Definition: A search method is defined by picking the order of node expansion.
Search strategies are evaluated according to completeness, time complexity, space complexity, optimality.
Time and space complexity are measured in terms of maximum branching, depth of the least-cost solution, maximum depth of the state space
Distinction between informed / uninformed search techniques
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License