Scribd
Upload
56 views

Assignment (MiniMax)

The document describes two questions that involve computing utility values for nodes in two-ply game trees using the Minimax algorithm and determining unnecessary paths using alpha-beta pruning. Question 1 provides a two-ply game tree with utility values at the terminal nodes and asks to compute values for other nodes using Minimax and identify paths not needing evaluation with alpha-beta pruning. Question 2 provides the same type of two-ply game tree and asks to perform the same Minimax and alpha-beta pruning computations and analysis.

Uploaded by

Mohamed Shaam
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
56 views

Assignment (MiniMax)

The document describes two questions that involve computing utility values for nodes in two-ply game trees using the Minimax algorithm and determining unnecessary paths using alpha-beta pruning. Question 1 provides a two-ply game tree with utility values at the terminal nodes and asks to compute values for other nodes using Minimax and identify paths not needing evaluation with alpha-beta pruning. Question 2 provides the same type of two-ply game tree and asks to perform the same Minimax and alpha-beta pruning computations and analysis.

Uploaded by

Mohamed Shaam
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Assignment

Q1.

a) In the following two-ply game tree, the terminal nodes show the utility values computed by the
utility function. Use the Minimax algorithm to compute the utility values for other nodes in the
given game tree.
b) Using the alpha and beta pruning concept, determine the unnecessary paths.

Q2.

a) In the following two-ply game tree, the terminal nodes show the utility values computed by the
utility function. Use the Minimax algorithm to compute the utility values for other nodes in the given
game tree.
b) Using the alpha and beta pruning concept, determine the unnecessary paths.

You might also like