Artificial Intelligence Mock Test 4

1. What is the other name for forward state-space search?

2. What is meant by consistent in state-space search?

3. Which is identical to the closed list in Graph search?

4. A complete, local search algorithm always finds goal if one exists, an optimal algorithm always finds a global minimum/maximum.

5. The minimax algorithm computes the minimax decision from the current state. It uses a simple recursive computation of the minimax values of each successor state, directly implementing the defining equations. The recursion proceeds all the way down to the leaves of the tree, and then the minimax values are backed up through the tree as the recursion unwinds.

6. What are taken into account of state-space search?

7. Language/Languages used for programming Constraint Programming includes ____________

8. Which is the most straightforward approach for planning algorithm?

9. To which depth does the alpha-beta pruning can be applied?

10. Constraint satisfaction problems on finite domains are typically solved using a form of ___________