Skip to content

cburkha2/monopoly

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

2 Commits
 
 
 
 

Repository files navigation

Markov Chains in Monopoly

This was my senior project at MSU Denver. I used Markov chains to find the long-run probability of hitting each space on the board, then examined rent values to determine which properties are most profitable to own.

I used this Python script to calculate each possible destination from each space on the board. Most of the actual math was done in R.

This code is messy. When I wrote this, I never expected anyone else to read it, so I paid little attention to formatting or readability beyond the bare minimum. The R code I wrote is even worse, and because of the poor quality I cannot share it in good conscience. Nevertheless, this continues to be a passion project, so I fully expect to eventually revisit this code, clean it up, and add more stuff to it.

About

My senior project at MSU Denver

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

 
 
 

Contributors

Languages