Carcassonne in the Classroom
Abstract
Learning about probability can be hard and frustrating for many students. However, learning about probability through examples with board games can make this task more interesting and fun. We present a sequence of increasingly difficult probability problems derived from the popular board game Carcassonne. Each question is appropriate either for a college classroom or for undergraduate research, with topics including basic counting problems, expected value, Bayes's theorem, Markov chains, and Monte Carlo simulation. Some problems have solutions, but other questions are left open for the reader to explore.
This paper has been withdrawn.
