Briefly explain how expecti-minimax algorithm operates. Alpha-beta. pruning is e

Question

Briefly explain how expecti-minimax algorithm operates. Alpha-beta. pruning is effective in game-tree search because it eliminates parts of the game tree that a) Cannot affect the evaluation of the game tree. b) Usually do not affect the evaluation of the game tree. c) Do not contain the state with the highest or lowest value in the tree. d) Repeat parts of the game tree that have already been generated. e) Lead to branches of infinite depth. In the MAX-MIN tree shown below, for what values of node X can node Y be pruned?

Explanation / Answer

4) In the expextiminimax algorithm , if state is a MAX node then it returns the highest expectiminimax algorithm value of successors(state), if state is a MIN node then return the lowest expectiminimax algorithm value of successors, if state is a chance node then it return average of expectiminimax algorithm successors.

5) because it eliminates parts of the game tree that

d) Repeat parts of the game tree that have already been generated

Related Questions

Navigate

• Browse (All)
• Browse B
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.