Alpha-Beta Pruning, BFS,DFS
Problem 1 – Label the statements as T (true) or F (false)
a) An agent that senses only partial information about the state cannot be perfectly rational.
b) It is possible for a given agent to be perfectly rational in two distinct task environments.
c) A perfectly rational poker-playing agent never loses.
d) The last component of the learning agent is the problem generator. It is responsible for suggesting actions that will lead to new and informative experiences.
Problem 2 – Write the order in which nodes are expanded for each type of search:
a) BFS
b) DFS
Problem 3 (25 Points) – The following problem asks about MINI-MAX search in game trees. Following the tree use Alpha-Beta Pruning. In this game Max Player will start the game. fill the Alpha and Beta in each step
Problem 4 (25 Points) – Explain the benefits of using Alpha-Beta Pruning.
