chess:programming:search:minimax
Differences
This shows you the differences between two versions of the page.
Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
chess:programming:search:minimax [2021/10/11 22:50] – peter | chess:programming:search:minimax [2021/10/11 23:33] (current) – peter | ||
---|---|---|---|
Line 1: | Line 1: | ||
====== Chess - Programming - Search - Minimax ====== | ====== Chess - Programming - Search - Minimax ====== | ||
- | ===== Minimax | + | **Minimax** is an algorithm used to determine the score in a zero-sum game after a certain number of moves, with best play according to an evaluation function. |
- | Minimax | + | * The score of each move is the score of the worst that the opponent can do. |
+ | |||
+ | ---- | ||
< | < | ||
Line 33: | Line 35: | ||
===== References ===== | ===== References ===== | ||
+ | |||
+ | http:// | ||
chess/programming/search/minimax.1633992635.txt.gz · Last modified: 2021/10/11 22:50 by peter