User Tools

Site Tools


chess:programming:search:minimax

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revisionPrevious revision
Next revision
Previous revision
chess:programming:search:minimax [2021/10/11 22:44] peterchess: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 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.+  * The score of each move is the score of the worst that the opponent can do. 
 + 
 +----
  
 <code> <code>
Line 30: Line 32:
  
  
 +----
 +
 +===== References =====
 +
 +http://web.archive.org/web/20120209041607/http://chessprogramming.wikispaces.com/Minimax
  
chess/programming/search/minimax.1633992274.txt.gz · Last modified: 2021/10/11 22:44 by peter

Donate Powered by PHP Valid HTML5 Valid CSS Driven by DokuWiki