Abstract
A.I. opponents have been a fixture of electronic games since the 1950’s. Over the course of the 20th and 21st centuries the technology has evolved to the computer opponents we know today. This paper will cover the implementation of an A.I opponent for the game Minotaurus, a 2-player perfect information dice-based strategy game, using the Minmax algorithm. Within the MonoGame framework, this implementation uses pathfinding and look-ahead to execute advantageous turns, based on Minmax evaluations. Over the course of the game, players seek to move their pieces to a designated end-zone while obstructing and capturing their opponent’s. This paper will detail how this implementation led to an A.I opponent that can make logical moves, operate beyond its explicit instruction and defeat human opponents
Advisor
Palmer, Daniel
Department
Computer Science
Recommended Citation
Bielski, William, "Creating an Artificial Opponent for the Game Minotaurus" (2024). Senior Independent Study Theses. Paper 10908.
https://openworks.wooster.edu/independentstudy/10908
Disciplines
Computational Engineering | Computer and Systems Architecture | Other Computer Engineering
Keywords
A.I., search algorithms, boardgame, chance, dice-based
Publication Date
2024
Degree Granted
Bachelor of Arts
Document Type
Senior Independent Study Thesis
External Link
https://github.com/WilliamBielski/IS_Project
© Copyright 2024 William Bielski
