Date of Award

2025

Document Type

Thesis

Degree Name

Bachelors

Department

Natural Sciences

First Advisor

McDonald, Patrick

Second Advisor

Serban, Vlad

Area of Concentration

Applied Mathematics

Abstract

We create two simple board games that follow the same rules, the player moves with the roll of a 5-sided dice and the player wins by being the first to reach the last space. One model is a straight path and the other has a bridge that takes the player directly to the last space. We analyze both models to find the average amount of rolls it would take to win a game. We find there are recursive equations to find the average number of rolls for both types of game.

Download

Share

COinS