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.
This mathematical analysis–related article is a stub.
You can help Wikipedia by expanding it.This game theory article is a stub.
You can help Wikipedia by expanding it.