Search Method in AI CH6 Flashcards

1
Q

Search Algorithms in AI

A

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

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Breadth First Search (Uninformed)

A

traverse one level at a time. FROM TOP TO BOTTOM FROM LEFT TO RIGHT
EG ABCDEFG

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Depth First Search (DFS) (Uninformed)

A
  • explores each adjacent node before backtracking and move to the next node
  • ABCEGJDFK
  • finished the whole of left then go right
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Best First Search (Informed)

A
  • a version of the first depth-first search using heuristics
  • the node closest to the final state is explored first
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

A* Search (Informed)

A
  • uses the path from the start node to the current node then to the destination
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Uninformed VS Informed Search Algorithms

A

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

How well did you know this?
1
Not at all
2
3
4
5
Perfectly