Scribd
Upload
50 views1 page

Assignment No.2

This assignment involves analyzing the game of tic-tac-toe by creating a full game tree that identifies the paths where player 1 wins, player 2 wins, or the game ends in a draw. The game tree and path analysis will provide insights into algorithms like minimax and alpha-beta pruning that are commonly used for adversarial game playing in artificial intelligence research. The assignment delivers on multiple program learning outcomes.

Uploaded by

Obaid Khan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
50 views1 page

Assignment No.2

This assignment involves analyzing the game of tic-tac-toe by creating a full game tree that identifies the paths where player 1 wins, player 2 wins, or the game ends in a draw. The game tree and path analysis will provide insights into algorithms like minimax and alpha-beta pruning that are commonly used for adversarial game playing in artificial intelligence research. The assignment delivers on multiple program learning outcomes.

Uploaded by

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

Assignment No.

CLO – 2 /C - 3/ PLO - 3

Adversarial searches and Games such as chess, tic-tac-toe, and Go are


interesting because they offer a pure abstraction of the competition between
the two opponents. It is this abstraction which makes game playing an attractive
area for AI research. You are required to do the following assignment.

1. Make a complete game tree for the Tic-Tac-Toe game.


2. Identify the paths where
a. Player 1 will Win
b. Player 2 Will Win
c. The Game Will Draw

This assignment will be further used in understanding of Minimax algorithm and


Alpha Beta Pruning.

You might also like