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 =>
Minimax last edited by VanMorrison on September 18, 2018 - 10:41
RecentChanges · StartingPoints · About
Edit page ·Search · Related · Page info · Latest diff
[Welcome to Sensei's Library!]
RecentChanges
StartingPoints
About
RandomPage
Search position
Page history
Latest page diff
Partner sites:
Go Teaching Ladder
Goproblems.com
Login / Prefs
Tools
Sensei's Library