CS607 Artificial Intelligance Assignment No.2 Fall Semester 2012

[Vuhelper]

CS607 Artificial Intelligance Assignment No.2 Fall Semester 2012


Artificial Intelligence
Assignment # 02
Fall 2012
Marks: [20]
Due Date Your assignment must be uploaded before or on 23rd November, 2012.
Uploading instructions:
Upload your assignment as a word file. It should have name [YourRollNo.doc]
Rules for Marking:
It should be clear that your assignment will not get any credit if: The assignment is submitted after due date. No assignment will be accepted through email. The submitted assignment file is corrupted. The assignment is copied.
Note:
Your answer must follow the below given specifications. You will be assigned zero marks if you do not follow these instructions. Font style: “Times New Roman” Font color: “Black” Font size: “12” Bold for heading only. Font in Italic is not allowed at all. No formatting or bullets are allowed to use.
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 search.