Max^n algorithm: Difference between revisions
Content deleted Content added
Updated short description Tags: Mobile edit Mobile app edit Android app edit App description change |
redirect - not enough in-depth coverage from independent, reliable sources to show they pass WP:GNG Tag: New redirect |
||
| Line 1: | Line 1: | ||
#REDIRECT [[n-player game ]] |
|||
{{short description|Decisive algorithm that solves n-player general-sum games}} |
|||
In [[combinatorial game theory]], the '''max<sup>n</sup>''' algorithm is an algorithm that finds an equilibrium point for a search tree to favor a specific player in [[n-player game|''n''-player games]]. The algorithm was designed by Luckhardt and Irani.<ref>{{cite conference |last1=Luckhardt |first1=Carol A. |last2=Irani |first2=Keki B. |title=An Algorithmic Solution of N-Person Games |date=11 August 1986 |conference=AAAI '86 |pages=158–162 |url=https://cdn.aaai.org/AAAI/1986/AAAI86-025.pdf |access-date=20 August 2024 |archive-date=19 April 2024 |archive-url=https://web.archive.org/web/20240419091220/https://cdn.aaai.org/AAAI/1986/AAAI86-025.pdf |url-status=live }}</ref> |
|||
== See also == |
|||
* [[Minimax algorithm]] |
|||
== References == |
|||
{{Reflist}} |
|||
[[Category:Game theory]] |
|||
{{mathanalysis-stub}} |
|||
{{gametheory-stub}} |
|||
{{Game theory}} |
|||
Latest revision as of 11:12, 2 May 2025
Redirect to: