Artificial Intelligence Practice Test 4

1. ____________ is/are useful when the original formulation of a problem is altered in some way, typically because the set of constraints to consider evolves because of the environment.

2. The term ___________ is used for a depth-first search that chooses values for one variable at a time and returns when a variable has no legal values left to assign.

3. _______________ Is an algorithm, a loop that continually moves in the direction of increasing value – that is uphill.

4. How many ways are available to solve the state-space search?

5. A* is optimal if h(n) is an admissible heuristic-that is, provided that h(n) never underestimates the cost to reach the goal.

6. A genetic algorithm (or GA) is a variant of stochastic beam search in which successor states are generated by combining two parent states, rather than by modifying a single state.

7. Which search is similar to minimax search?

8. Which values are independant in minimax search algorithm?

9. A game can be formally defined as a kind of search problem with the following components.

10. What is the other name of the backward state-space search?