Wednesday, 21 November 2012
Objective
It will improve the understanding and enhance the skills of the student to learn different
search algorithms and adversarial search. It has been used in applications such as games
etc.
Assignment
Playing of games can be effectively modeled as a search problem. Estimation functions estimate
the quality of a given board configuration for the Max player in any oppositional game. Minimax
is a procedure which selects moves by assuming that the challenger will always choose the move
which is best for them. Alpha-Beta is a technique which can prune large parts of the search tree
and allow search to go deeper. The Min level values are given in the leaf nodes of a tree.
1. You have required to select the max value by the help of α-β pruning.
2. You should also mention the tree nodes those are pruned during sea
It will improve the understanding and enhance the skills of the student to learn different
search algorithms and adversarial search. It has been used in applications such as games
etc.
Assignment
Playing of games can be effectively modeled as a search problem. Estimation functions estimate
the quality of a given board configuration for the Max player in any oppositional game. Minimax
is a procedure which selects moves by assuming that the challenger will always choose the move
which is best for them. Alpha-Beta is a technique which can prune large parts of the search tree
and allow search to go deeper. The Min level values are given in the leaf nodes of a tree.
1. You have required to select the max value by the help of α-β pruning.
2. You should also mention the tree nodes those are pruned during sea
