Minimax

Path: <= CGT path =>
  Difficulty: Advanced   Keywords: EndGame, Theory

This page is currently a placeholder until someone who really knows CGT adds content to it.

Please see the /Discussion page.

--unkx80


See also:

Maybe NegaMax might be more appropriate: see [ext] http://www.xs4all.nl/~verhelst/chess/search.html#minimax

mdm: NegaMax is just an implementation detail of Minimax. From the theoretical viewpoint the algorithm does not change. An actual improvement to Minimax is "Alpha-beta pruning": [ext] http://en.wikipedia.org/wiki/Alpha-beta_pruning


Path: <= CGT path =>
This is a copy of the living page "Minimax" at Sensei's Library.
(OC) 2016 the Authors, published under the OpenContent License V1.0.
[Welcome to Sensei's Library!]
StartingPoints
ReferenceSection
About