Scribd
Upload
91 views6 pages

Quiz 1 2019

This document summarizes a quiz on adversarial search and the minimax algorithm with alpha-beta pruning. It contains 5 multiple choice and short answer questions about pruning a game tree. It also contains a short question about determining the move of an AI player in the game Connect 4 using minimax search on a provided board state.

Uploaded by

Muhammad Wajahat Ali Khan FastNU
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
91 views6 pages

Quiz 1 2019

This document summarizes a quiz on adversarial search and the minimax algorithm with alpha-beta pruning. It contains 5 multiple choice and short answer questions about pruning a game tree. It also contains a short question about determining the move of an AI player in the game Connect 4 using minimax search on a provided board state.

Uploaded by

Muhammad Wajahat Ali Khan FastNU
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/ 6

Roll No.

________________
National University of Computer and Emerging Sciences, Lahore Campus
Course Name: Artificial Intelligence Course Code: CS 401
Program: BS(CS) Semester: Spring 2019
Duration: 20 Minutes Total Points: 10
Paper Date: Thursday, February 21, 2019 Weight 3%
Section: C, D, E Page(s): 2
Exam Type: Quiz 1

Student : Name:_____________________________ Roll No.________________ Section:_______

Problem. Adversarial Search [1 + 1 + 1 + 5 +2 Points]

Consider the game tree picture below where A-F represent some real values. Assume the nodes
are explored from left to right and standard alpha beta pruning is used.

Part a) Give a value of A such that B is pruned.

Part b) [True or False] There are SOME values of A and B such that the sub-tree containing C and
D is pruned? If true specify the values and if false give a reason

School of Computer Science


Roll No.________________

Part c) Assuming that B = 5 and A = 5, give a value of C and D such that the sub-tree containing E
and F is pruned.

Part d) For what values of A, B, C, D, E, and F a none of the nodes will be pruned by the alpha-beta
pruning algorithm. (More than one possible answers)

Part e) For what values of A, B, C, D, E, and F a maximum of the nodes will be pruned by the alpha-
beta pruning algorithm Specify all pruned nodes for the values you specify and also mark all pruned
nodes. (More than one possible solution)

School of Computer Science


Roll No.________________
National University of Computer and Emerging Sciences, Lahore Campus
Course Name: Artificial Intelligence Course Code: CS 401
Program: BS(CS) Semester: Spring 2019
Duration: 20 Minutes Total Points: 10
Paper Date: Thursday, February 21, 2019 Weight 3%
Section: C, D, E Page(s): 2
Exam Type: Quiz 1

Student : Name:_____________________________ Roll No.________________ Section:_______

Problem. Adversarial Search [3 + 7 Points]

Connect Four is a two-player connection game in which the players first take turns
dropping marked discs (Marked X disc for computer player and Marked O disc for
human player) from the top into a seven-column, six-row vertically suspended grid. The
pieces fall straight down, occupying the next available space within the column.

The objective of the game is to connect four discs of the same mark next to each other
vertically, horizontally, or diagonally before your opponent.

After taking the exciting course of AI at FAST some of our students have implemented
an auto-player of connect-4 that uses MINIMAX algorithm with alpha-beta pruning to
play the game.

While playing the game the auto-player (marking X) reached the following board position
and it is his turn to make a move.

Part a) [3 Points]
Draw a complete game tree that will be used by the auto-player to make the move.

School of Computer Science


Roll No.________________

Part b) [7 Points]
Use the MINIMAX algorithm to determine the move of auto-player. Which part of the
tree will be pruned by the auto-player if he always expand the nodes from left to right in
your game tree?

School of Computer Science


Roll No.________________
National University of Computer and Emerging Sciences, Lahore Campus
Course Name: Artificial Intelligence Course Code: CS 401
Program: BS(CS) Semester: Spring 2019
Duration: 20 Minutes Total Points: 10
Paper Date: Thursday, February 21, 2019 Weight 3%
Section: C, D, E Page(s): 2
Exam Type: Quiz 1

Student : Name:_____________________________ Roll No.________________ Section:_______

Problem. Adversarial Search [3 + 7 Points]

At some point in a two player game the possible actions for the two players are shown in
the following tree.

Assume that MINIMAX algorithm with alpha-beta pruning is used to determine the move
for MAX at this point in the game.

School of Computer Science


Roll No.________________
Determine
 the minimax value of each of the nodes in this tree

 the nodes that will be pruned and value of alpha and beta when the pruning decision
was taken

School of Computer Science

You might also like