Markers
--------------------------------------------------------------------------------
Animated example of Minimax (Naïve): 03:03
Minimax (Naïve) psuedocode walkthrough: 13:23
Animated example of Minimax (AlphaBeta): 26:23
Minimax (AlphaBeta) psuedocode walkthrough: 35:09
References
--------------------------------------------------------------------------------
Minimax Psuedocode
[ Ссылка ]
Alpha-beta Pruning Psuedocode
[ Ссылка ]
Game Tree Video Lecture (Indian Institute of Technology)
[ Ссылка ]
CS 161 Recitation Notes - Minimax with Alpha Beta Pruning (University of California, Los Angeles)
[ Ссылка ]
How many Tic-Tac-Toe (noughts and crosses) games are possible?
[ Ссылка ]
Strategies and Tactics for Intelligent Search
[ Ссылка ]
An Exhaustive Explanation of Minimax, a Staple AI Algorithm
[ Ссылка ]
Additional Resources
-------------------------------------------------------------------------------
Game Visualization (Minimax Java Applet)
[ Ссылка ]
Demo: minimax game search algorithm with alpha-beta pruning (HTML5 Applet)
[ Ссылка ]
![](https://i.ytimg.com/vi/J1GoI5WHBto/maxresdefault.jpg)