Podcast
Questions and Answers
Depth-first search always expands the deepest node in the current frontier.
Depth-first search always expands the deepest node in the current frontier.
True
A heuristic h(n) is admissible if it only overestimates the cost to reach the goal in a few cases.
A heuristic h(n) is admissible if it only overestimates the cost to reach the goal in a few cases.
False
Consider depth-limited search on a uniform search tree with branching factor 𝑏, maximum depth 𝑙 (for the limit of depth-limited search as well as the search tree) and assume that the only node with a goal state is at depth 𝑑.
The time complexity of depth-limited search is 𝑂(𝑏𝑑).
Consider depth-limited search on a uniform search tree with branching factor 𝑏, maximum depth 𝑙 (for the limit of depth-limited search as well as the search tree) and assume that the only node with a goal state is at depth 𝑑. The time complexity of depth-limited search is 𝑂(𝑏𝑑).
False
Consider a route finding problem like the ones discussed in class. A colleague suggests to use half the line of sight distance from a state to the goal as a heuristic. This is an admissible heuristic.
Consider a route finding problem like the ones discussed in class. A colleague suggests to use half the line of sight distance from a state to the goal as a heuristic. This is an admissible heuristic.
Signup and view all the answers
Assume a finite state space and that all step costs are positive.
Greedy best-first search is optimal if we use the true minimal path cost from a node to the goal as the heuristic.
Assume a finite state space and that all step costs are positive. Greedy best-first search is optimal if we use the true minimal path cost from a node to the goal as the heuristic.
Signup and view all the answers
Uniform cost-search always expands the node from the frontier with the lowest path cost 𝑔(𝑛).
Uniform cost-search always expands the node from the frontier with the lowest path cost 𝑔(𝑛).
Signup and view all the answers
Which statement(s) are true for A* search?
Which statement(s) are true for A* search?
Signup and view all the answers
Perform A* search for the problem shown below (start location: Sibiu; destination location: Bucharest). The table shows the heuristic to be used. What is the cost of the found solution?
Perform A* search for the problem shown below (start location: Sibiu; destination location: Bucharest). The table shows the heuristic to be used. What is the cost of the found solution?
Signup and view all the answers
Consider the route-finding problem shown below with goal state Bucharest. We want to specify an admissible heuristic ℎ(𝑛). How large can ℎ(In(Fagaras)) be at most?
Consider the route-finding problem shown below with goal state Bucharest. We want to specify an admissible heuristic ℎ(𝑛). How large can ℎ(In(Fagaras)) be at most?
Signup and view all the answers
Perform the greedy best-first search for the problem shown below (start location: Sibiu; destination location: Bucharest). The table shows the heuristic to be used. What is the cost of the found solution?
Perform the greedy best-first search for the problem shown below (start location: Sibiu; destination location: Bucharest). The table shows the heuristic to be used. What is the cost of the found solution?
Signup and view all the answers
