<ul><li>Minimax and Alpha-Beta Pruning are types of Greedy Algorithms used to improve efficiency and speed of programs.</li><li>Minimax evaluates each move based on the number of points gained and selects the move that gives the maximum value.</li><li>Minimax considers opponent's optimal moves and plays defensively to minimize the opponent's points.</li><li>Alpha-beta pruning helps AI avoid unnecessary calculations by skipping bad moves and focusing on better options.</li></ul>

Science behind Greedy Algorithms — Minimax

Discover more