Max^n algorithm - Revision history

Onel5969: redirect - not enough in-depth coverage from independent, reliable sources to show they pass WP:GNG

2025-05-02T11:12:00Z

redirect - not enough in-depth coverage from independent, reliable sources to show they pass WP:GNG

← Previous revision		Revision as of 11:12, 2 May 2025
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}}

Tc14Hd: Updated short description

2025-03-17T16:15:56Z

Updated short description

← Previous revision		Revision as of 16:15, 17 March 2025
Line 1:		Line 1:
	{{short description\|~~A decisive~~ algorithm that solves $n$-player general-sum games.}}		{{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>		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>

Neutronstar2: Neutronstar2 moved page Maxn algorithm to Max^n algorithm: Bring the article's title closer to the actual scientific notation

2024-08-31T09:37:53Z

Neutronstar2 moved page Maxn algorithm to Max^n algorithm: Bring the article's title closer to the actual scientific notation

← Previous revision	Revision as of 09:37, 31 August 2024
(No difference)

Frap: Italic

2024-08-26T12:47:19Z

Italic

← Previous revision		Revision as of 12:47, 26 August 2024
Line 1:		Line 1:
	{{short description\|A decisive algorithm that solves $n$-player general-sum games.}}		{{short description\|A 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>		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 ==		== See also ==

LeoDog896: Game theory -> Combinatorial

2024-08-21T17:23:04Z

Game theory -> Combinatorial

← Previous revision		Revision as of 17:23, 21 August 2024
Line 1:		Line 1:
	{{short description\|A decisive algorithm that solves $n$-player general-sum games.}}		{{short description\|A decisive algorithm that solves $n$-player general-sum games.}}

	In ~~the mathematical area of~~ [[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>		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 ==		== See also ==

LeoDog896: Put in category of game theory

2024-08-21T16:19:07Z

Put in category of game theory

← Previous revision		Revision as of 16:19, 21 August 2024
Line 15:		Line 15:
	{{mathanalysis-stub}}		{{mathanalysis-stub}}
	{{gametheory-stub}}		{{gametheory-stub}}

			{{Game theory}}

LeoDog896: Mention maxn's specific application for n-player games

2024-08-21T16:15:54Z

Mention maxn's specific application for n-player games

← Previous revision		Revision as of 16:15, 21 August 2024
Line 1:		Line 1:
	{{short description\|A decisive algorithm that solves $n$-player general-sum games.}}		{{short description\|A decisive algorithm that solves $n$-player general-sum games.}}

	In the mathematical area of [[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. 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>		In the mathematical area of [[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 ==		== See also ==

LeoDog896: Remove orphan tag - linked from n-player games and minimax

2024-08-21T15:53:24Z

Remove orphan tag - linked from n-player games and minimax

← Previous revision		Revision as of 15:53, 21 August 2024
Line 1:		Line 1:
	{{short description\|A decisive algorithm that solves $n$-player general-sum games.}}		{{short description\|A decisive algorithm that solves $n$-player general-sum games.}}
	{{Orphan\|date=August 2024}}

	In the mathematical area of [[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. 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>		In the mathematical area of [[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. 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>

Onel5969: /* top */ clean up, added orphan tag

2024-08-21T10:00:07Z

top: clean up, added orphan tag

← Previous revision		Revision as of 10:00, 21 August 2024
Line 1:		Line 1:
	{{short description\|A decisive algorithm that solves $n$-player general-sum games.}}		{{short description\|A decisive algorithm that solves $n$-player general-sum games.}}
			{{Orphan\|date=August 2024}}

	In the mathematical area of [[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. 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>		In the mathematical area of [[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. 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>

Snowman304: Rescuing 1 sources and tagging 0 as dead.) #IABot (v2.0.9.5

2024-08-21T03:31:24Z

Rescuing 1 sources and tagging 0 as dead.) #IABot (v2.0.9.5

← Previous revision		Revision as of 03:31, 21 August 2024
Line 1:		Line 1:
	{{short description\|A decisive algorithm that solves $n$-player general-sum games.}}		{{short description\|A decisive algorithm that solves $n$-player general-sum games.}}

	In the mathematical area of [[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. 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}}</ref>		In the mathematical area of [[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. 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 ==		== See also ==

← Previous revision		Revision as of 15:53, 21 August 2024
Line 1:		Line 1:
	{{short description\|A decisive algorithm that solves $n$-player general-sum games.}}		{{short description\|A decisive algorithm that solves $n$-player general-sum games.}}
	{{Orphan\|date=August 2024}}

	In the mathematical area of [[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. 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>		In the mathematical area of [[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. 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>

← Previous revision		Revision as of 10:00, 21 August 2024
Line 1:		Line 1:
	{{short description\|A decisive algorithm that solves $n$-player general-sum games.}}		{{short description\|A decisive algorithm that solves $n$-player general-sum games.}}
			{{Orphan\|date=August 2024}}

	In the mathematical area of [[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. 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>		In the mathematical area of [[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. 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>