MiniMax Game Trees
Advertisements
| Top Tutorials | New Tutorials | Submit | Login | Register |
Tutorial Detail
MiniMax Game Trees
Learn about coding a decision-making program.http://www.cprogramming.com/tutorial/AI/minimaxtree1.html
Total Hits: 3154
Total Votes: 36 votes
Category: C and C++/Game Programming
Submitted on: 2008-04-16 02:08:20
Submitted By: Shekhar
Description:
The Minimax Game Tree is used for programming computers to play games in which there are two players taking turns to play moves. In the most basic sense, the minimax tree is just a tree of all possible moves. For instance, take a look at the following minimax tree of all the possible first two moves of Tic-Tac-Toe (the tree has been simplified by removing symmetrical positions). More detail...Rating Detail
| Stars | Percentage | Total Vote |
|---|---|---|
![]() |
![]() ![]() 16.67% |
6 |
![]() ![]() |
![]() ![]() 16.67% |
6 |
![]() ![]() ![]() |
![]() ![]() 16.67% |
6 |
![]() ![]() ![]() ![]() |
![]() ![]() 16.67% |
6 |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() 16.67% |
6 |





16.67%

16.67%

16.67%

16.67%

16.67%