CSCI 6350 Artificial Intelligence: Minimax and Alpha-Beta Pruning Algorithms and Psuedocodes

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
http://en.wikipedia.org/wiki/Minimax

Alpha-beta Pruning Psuedocode
http://en.wikipedia.org/wiki/Alpha%E2...

Game Tree Video Lecture (Indian Institute of Technology)
   • Lecture - 7 Searching Game Trees  

CS 161 Recitation Notes - Minimax with Alpha Beta Pruning (University of California, Los Angeles)
http://cs.ucla.edu/~rosen/161/notes/a...

How many Tic-Tac-Toe (noughts and crosses) games are possible?
http://www.se16.info/hgb/tictactoe.htm

Strategies and Tactics for Intelligent Search
http://web.stanford.edu/~msirota/soco...

An Exhaustive Explanation of Minimax, a Staple AI Algorithm
http://www.flyingmachinestudios.com/p...

Additional Resources
-------------------------------------------------------------------------------

Game Visualization (Minimax Java Applet)
http://ksquared.de/gamevisual/launch.php

Demo: minimax game search algorithm with alpha-beta pruning (HTML5 Applet)
http://homepage.ufp.pt/jtorres/ensino...