About this document
Minimax and Alpha-Beta Pruning in AI by muhamad sulanjari is a document available to read on EtoBox.
The document summarizes techniques for game-playing AI, including the minimax rule, alpha-beta pruning, and successes of game-playing AIs. The minimax rule determines the best move for a player by recursively evaluating all possible moves assuming the opponent picks their optimal counter-move. Alpha-beta pruning improves minimax search by pruning branches that cannot affect the final value. Successful game-playing AIs that used these techniques include Chinook, the world checkers champion, and Deep Blue, wh
- Author
- muhamad sulanjari
- Language
- EN