Assignment:
Artificial Intelligence
1 Define in your own words:
o Intelligence
o Artificial Intelligence
o Agent
o Rationality
o logical reasoning.
2. What's the difference between a world state, a state description, and a search node? Why is this distinction useful?
3. Give the name of the algorithm that results from each of the following special cases:
o Local beam search with k = 1.
o Local beam search with one initial state and no limit on the number of states retained.
o Simulated annealing with T = 0 at all times (and omitting the termination test).
o Simulated annealing with T = ∞ at all times.
o Genetic algorithm with population size N = 1.
4. Which of the following are true and which are false? Give brief explanations.
o In a fully observable, turn-taking, zero-sum game between two perfectly rational players, it does not help the first player to know what strategy the second player is using- that is, what move the second player will make, given the first player's move.
o In a partially observable, turn-taking, zero-sum game between two perfectly rational players, it does not help the first player to know what move the second player will make, given the first player's move.
o A perfectly rational backgammon agent never loses.