Search Flashcards
1
Q
What must be the characteristic of our enviroment in order to perform a search?
A
4 - 6
2
Q
Define a problem
A
4 - 11 to 18
3
Q
Describe a simple problem solving agent
A
4 - 8
4
Q
Define the frontier of a search tree
A
4 - 29
4
Q
What is a search strategy? What are the evaluation parameters?
A
4 - 40
5
Q
Write the pseudo code for the tree search algorithm
A
4 - 30
5
Q
Write the pseudo code for the graph search algorithm
A
4 - 35
5
Q
what is the state space
A
4 - 15
6
Q
Describe how depth-first search works
A
4 - 49
7
Q
Describe how uniform-cost search works
A
4 - 48
7
Q
state vs node
A
4 - 37
8
Q
Describe how breadth-first search works (opt give ev param)
A
4 - 43
9
Q
Describe how depth-limited search works
A
4 - 55
10
Q
Describe the idea behind best-first search
A
4 - 66
10
Q
Describe how iterative deepening search works (opt give ev param)
A
4 - 56
