Artificial Intelligence Practice Test 4

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

2. ___________ algorithm keeps track of k states rather than just one.

3. What are the main cons of hill-climbing search?

4. Solving a constraint satisfaction problem on a finite domain is an/a ___________ problem with respect to the domain size.

5. Which function is used to calculate the feasibility of whole game tree?

6. Mathematical game theory, a branch of economics, views any multi-agent environment as a game provided that the impact of each agent on the others is "significant," regardless of whether the agents are cooperative or competitive.

7. Zero sum game has to be a ______ game.

8. Translate the following statement into FOL.
"For every a, if a is a philosopher, then a is a scholar"

9. Which values are independant in minimax search algorithm?

10. General games involves ____________