Search Method in AI CH6 Flashcards
Search Algorithms in AI
UNINFORMED (have no info about the problem)
- breadth first search (bfs)
- uniform cost search (ucs)
- depth first search (dfs)
- depth limited search (dls)
- iterative deeping depth first search (iddfs)
INFORMED SEARCH (exploring paths to find a solution)
- Best First Search (BFS)
- A* Search
Breadth First Search (Uninformed)
traverse one level at a time. FROM TOP TO BOTTOM FROM LEFT TO RIGHT
EG ABCDEFG
Depth First Search (DFS) (Uninformed)
- explores each adjacent node before backtracking and move to the next node
- ABCEGJDFK
- finished the whole of left then go right
Best First Search (Informed)
- a version of the first depth-first search using heuristics
- the node closest to the final state is explored first
A* Search (Informed)
- uses the path from the start node to the current node then to the destination
Uninformed VS Informed Search Algorithms
UNINFORMED
- Does not require knowledge during searching process
- Finding a solution is much slower
- Consume too much time
INFORMED
- Uses knowledge during search process
- Finding solution is quicker
- Quicker search leads to less time being consumed