In combinatorial game theory, the max algorithm is an algorithm that finds an equilibrium point for a search tree to favor a specific player in n-player games. The algorithm was designed by Luckhardt and Irani.
See also
References
- Luckhardt, Carol A.; Irani, Keki B. (11 August 1986). An Algorithmic Solution of N-Person Games (PDF). AAAI '86. pp. 158–162. Archived (PDF) from the original on 19 April 2024. Retrieved 20 August 2024.
This mathematical analysis–related article is a stub. You can help Misplaced Pages by expanding it. |
This game theory article is a stub. You can help Misplaced Pages by expanding it. |