Dissertation/Thesis Abstract

Mathematical Programming and Magic: The Gathering®
by Esche, Alexander, M.S., Northern Illinois University, 2018, 51; 10689404
Abstract (Summary)

In this paper mathematical programming techniques were used to determine the optimal strategy for playing Magic: The Gathering®. Games with the cards Lightning Bolt, Mountain, and Vexing Devil were evaluated using the minimax algorithm to determine the winner when all information about the cards is assumed known to both players. Computation time was shortened through the use of an evaluation function, a random forest algorithm that had been trained on 1000 completed games. A winning percentage was established for each pair of decks where the number of creatures was less than eight. Using linear programming, the optimal mixed strategy was then calculated. By repeating the simulations, a standard deviation for the winning percentages was estimated. Techniques from robust optimization were then used to determine the optimal strategy under different possible variations. Last, an imperfect information player was constructed that made choices based on guessing the order of the cards in its deck and the composition of the opponent's deck, playing through the perfect information games of these guesses, and making the choice that won in most of these simulations. With decks of eight or fewer creatures, this imperfect information player played below or near a player who used an aggressive heuristic. When the number of possible creatures was increased to 16, the imperfect information player's performance was better than the aggressive heuristic.

Indexing (document details)
Advisor: Krislock, Nathan, Garivaltis, Alexander
Commitee: Thunder, Jeffrey, Zhou, Haiming
School: Northern Illinois University
Department: Mathematical Sciences
School Location: United States -- Illinois
Source: MAI 57/06M(E), Masters Abstracts International
Subjects: Mathematics
Keywords: Conic programming, Game theory, Minimax, Optimization, Random forest, Robust optimization
Publication Number: 10689404
ISBN: 978-0-438-03228-6
Copyright © 2021 ProQuest LLC. All rights reserved. Terms and Conditions Privacy Policy Cookie Policy