Change search
ReferencesLink to record
Permanent link

Direct link
N-Person Minimax and Alpha-Beta Pruning
Uppsala University, Disciplinary Domain of Humanities and Social Sciences, Faculty of Arts, Department of Game Design.
2014 (English)In: NICOGRAPH International 2014, 2014, 43-52 p.Conference paper (Refereed)
Abstract [en]

This paper presents an N-person generalization of minimax aligned with the original definition. An efficient optimization method is further presented as a result of a straightforward mathematical extension of alpha-beta pruning to N-person games. 

Place, publisher, year, edition, pages
2014. 43-52 p.
Keyword [en]
alpha-beta pruning; dihedral angle; hypermax; minimax; multiplayer; N-max; N-person; N-player; simplex; strategic games; zero-sum lemma
National Category
Computer Systems
Research subject
Mathematics; Computing Science
URN: urn:nbn:se:uu:diva-235687OAI: diva2:761634
NICOGRAPH International 2014, Visby, Sweden, May 2014
Available from: 2014-11-07 Created: 2014-11-07 Last updated: 2014-11-11Bibliographically approved

Open Access in DiVA

fulltext(399 kB)153 downloads
File information
File name FULLTEXT01.pdfFile size 399 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Fridenfalk, Mikael
By organisation
Department of Game Design
Computer Systems

Search outside of DiVA

GoogleGoogle Scholar
Total: 153 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 348 hits
ReferencesLink to record
Permanent link

Direct link