3. (30 pts.) Match the most appropriate word (s) to the statements below. You may select only one option. a. Actuators b. Agent Function c. Alpha-Beta Pruning d. Cognitive Science e. Completeness f. Constraint Satisfaction g. Control Theory h. Deterministic i. Dynamic Environment j. Economics k. Fully Observable 1. Heuristic Function m. Hill Climbing n. Logic 0. Machine Learning p. Multi-Agent Environment 9. Natural Language Processing r. Partially Observable s. Philosophy t. Psychology u. Rational Agent V. Sequential Environment W. Sensors X. Simulated Annealing y. Stochastic z. Zero-Sum Game An agent's next state cannot be completely determined by the current state and the action of the agent. An algorithm that utilizes randomness to enhance efficiency and completeness. Criteria that specifies that an algorithm is guaranteed to find a solution if there is one. Represented by final utility values that are equal but Opposite (commonly -1 and 1) Used to mathematically describe an agents behavior in its environment. Technique that allows for an algorithm to ignore part of the search tree This could change while an agent is deliberating on what to do next. Must be mastered in order for an AI computer to communicate successfully. An agent uses these to act on things in its environment Used by informed search strategies