Scribd
Upload
53 views11 pages

Game Tree and Minimax Algorithm Overview

The document discusses the concepts of game trees and the minimax algorithm in the context of adversarial games. It outlines the assumptions for studying game playing, the structure of game trees, and the utility of the minimax algorithm for decision-making in two-player games. Additionally, it highlights the complexity of search spaces in games like Tic-Tac-Toe and Chess.

Uploaded by

Md murad hosen
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
53 views11 pages

Game Tree and Minimax Algorithm Overview

The document discusses the concepts of game trees and the minimax algorithm in the context of adversarial games. It outlines the assumptions for studying game playing, the structure of game trees, and the utility of the minimax algorithm for decision-making in two-player games. Additionally, it highlights the complexity of search spaces in games like Tic-Tac-Toe and Chess.

Uploaded by

Md murad hosen
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

Game Tree and Minimax Algorithm

Presented by
Md. Rafid Ahmmed (200102)
Saniul Basir Saz (200103)
Nazmus Sakib Sibly (200104)
Abrar Hossain (200105)
Why Study Game Playing?
Assumptions
● Static or dynamic?
● Fully or partially observable?
● Discrete or continuous?
● Deterministic or stochastic?
● Episodic or sequential?
● Single agent or multiple agent?
Zero-Sum Games
Vs
Adversarial Games
Search Applied to Adversarial Games

● Initial State
-Current board position
● Operators
-Legal moves a player can make
● Terminal Nodes
-Leaf nodes in the tree
-Indicate the game is over
● Utility function
-value of the outcome of a game
Basic Terminology

Adversarial search: Adversarial search is a type of search algorithm used in


artificial intelligence (AI) to determine the best course of action for a given player,
considering the possible moves and counter-moves of the opponent(s)
Game Tree: A game tree is a tree structure that represents all possible moves in a
sequential game
Minimax Algorithm: Minimax algorithm is a decision-making algorithm
commonly used in two-player, turn-based games like chess, tic-tac-toe, and
checkers.
Game Tree (Tic-Tac-Toe)
Game Tree (Tic-Tac-Toe)

Possible Search Space Analysis:

9 * 8 * 7 * … * 1 = 9! = 362,880
Game Tree (Chess)

Analysis:

● Possible Search Space: Highly Complex (MiniMax Algorithm is involved)


Minimax Algorithm

Overview:

● A recursive or backtracking algorithm


● Used in decision-making and game theory
● It’s designed to find the optimal move for a player by assuming that the
opponent will also play optimally
● Performs a depth-first search algorithm

You might also like