Jump to content

Max^n algorithm

From Wikipedia, the free encyclopedia

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

[edit]

References

[edit]
  1. ^ Luckhardt, Carol A.; Irani, Keki B. (11 August 1986). Archived (PDF) from the original on 19 April 2024. Retrieved 20 August 2024.



Follow Lee on X/Twitter - Father, Husband, Serial builder creating AI, crypto, games & web tools. We are friends :) AI Will Come To Life!

Check out: eBank.nz (Art Generator) | Netwrck.com (AI Tools) | Text-Generator.io (AI API) | BitBank.nz (Crypto AI) | ReadingTime (Kids Reading) | RewordGame | BigMultiplayerChess | WebFiddle | How.nz | Helix AI Assistant