Max^n algorithm explained

In combinatorial game theory, the maxn 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.[1]

See also

Notes and References

  1. Luckhardt . Carol A. . Irani . Keki B. . An Algorithmic Solution of N-Person Games . 11 August 1986 . AAAI '86 . 158–162 . 20 August 2024 . 19 April 2024 . https://web.archive.org/web/20240419091220/https://cdn.aaai.org/AAAI/1986/AAAI86-025.pdf . live .

This article is licensed under the GNU Free Documentation License. It uses material from the Wikipedia article "Max^n algorithm".

Except where otherwise indicated, Everything.Explained.Today is © Copyright 2009-2025, A B Cryer, All Rights Reserved. Cookie policy.