Back to search

Cal Poly

Recursive Marix Game Analysis: Optimal, Simplified, And Human Strategies In Brave Rats

Abstract

dc:description.abstract

Brave Rats is a short game with simple rules, yet establishing a comprehensive strategy is very challenging without extensive computation. After explaining the rules, this paper begins by calculating the optimal strategy by recursively solving each turn’s Minimax strategy. It then provides summary statistics about the complex, branching Minimax solution. Next, we examine six other strategy models and evaluate their performance against each other. These models’ flaws highlight the key elements that contribute to the effectiveness of the Minimax strategy and offer insight into simpler strategies that human players could mimic. Finally, we analyze 123 games of human data collected by the author and friends and investigate how that data is different from Minimax optimal play.

Degree

thesis:*
Name thesis:degree_name
MS in Statistics
Discipline thesis:degree_discipline
Statistics

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Medwid, William A
Contributors dc:contributor
  • Kevin Ross
  • Statistics
  • College of Science and Mathematics

Subjects

dc:subject × 9

Identifiers

dc:identifier.*
Repository record dc:identifier
https://digitalcommons.calpoly.edu/theses/2810

Chain of custody

source
Harvested from
Cal Poly
Base URL
digitalcommons.calpoly.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Medwid, William A. Recursive Marix Game Analysis: Optimal, Simplified, And Human Strategies In Brave Rats. https://digitalcommons.calpoly.edu/theses/2810