Jump to content

Max^n algorithm

Add links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by LeoDog896 (talk | contribs) at 15:53, 21 August 2024 (Remove orphan tag - linked from n-player games and minimax). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In the mathematical area of game theory, the maxn algorithm is an algorithm that finds an equilibrium point for a search tree to favor a specific player. The algorithm was designed by Luckhardt and Irani.[1]

See also

References

  1. ^ 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.


Stub icon

This mathematical analysis–related article is a stub. You can help Wikipedia by expanding it.

Stub icon

This game theory article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Max%5En_algorithm&oldid=1241512248"