Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 6 of 6
Full-Text Articles in Entire DC Network
Book Review: Across The Board: The Mathematics Of Chessboard Problems By John J. Watkins, Arthur T. Benjamin
Book Review: Across The Board: The Mathematics Of Chessboard Problems By John J. Watkins, Arthur T. Benjamin
All HMC Faculty Publications and Research
I think I became a mathematician because I loved to play games as a child. I learned about probability and expectation by playing games like backgammon, bridge, and Risk. But I experienced the greater thrill of careful deductive reasoning through games like Mastermind and chess. In fact, for many years I took the game of chess quite seriously and played in many tournaments. But I gave up the game when I started college and turned my attention to more serious pursuits, like learning real mathematics.
Analysis Of The N-Card Version Of The Game Le Her, Arthur T. Benjamin, Alan J. Goldman
Analysis Of The N-Card Version Of The Game Le Her, Arthur T. Benjamin, Alan J. Goldman
All HMC Faculty Publications and Research
We present a complete solution to a card game with historical origins. Our analysis exploits the convexity properties in the payoff matrix, allowing this discrete game to be resolved by continuous methods.
Unevening The Odds Of "Even Up", Arthur T. Benjamin, Jennifer J. Quinn
Unevening The Odds Of "Even Up", Arthur T. Benjamin, Jennifer J. Quinn
All HMC Faculty Publications and Research
No abstract provided in this article.
The Best Way To Knock 'M Down, Arthur T. Benjamin, Matthew T. Fluet '99
The Best Way To Knock 'M Down, Arthur T. Benjamin, Matthew T. Fluet '99
All HMC Faculty Publications and Research
"Knock 'm Down" is a game of dice that is so easy to learn that it is being played in classrooms around the world. Although this game has been effective at developing students' intuition about probability [Fendel et al. 1997; Hunt 1998], we will show that lurking underneath this deceptively simple game are many surprising and highly unintuitive results.
Bounds On A Bug, Arthur T. Benjamin, Matthew T. Fluet '99
Bounds On A Bug, Arthur T. Benjamin, Matthew T. Fluet '99
All HMC Faculty Publications and Research
In the game of Cootie, players race to construct a "cootie bug" by rolling a die to collect component parts. Each cootie bug is composed of a body, a head, two eyes, one nose, two antennae, and six legs. Players must first acquire the body of the bug by rolling a 1. Next, they must roll a 2 to add the head to the body. Once the body and head are both in place, the remaining body parts can be obtained in any order by rolling two 3s for the eyes, one 4 for the nose, two 5s for the …
Optimal Klappenspiel, Arthur T. Benjamin, Derek Stanford '93
Optimal Klappenspiel, Arthur T. Benjamin, Derek Stanford '93
All HMC Faculty Publications and Research
The game Klappenspiel ("flipping game") is a traditional German game of flipping tiles according to dice rolls. In this paper, we derive the optimal strategy for this game by using dynamic programming. We show that the probability of winning using the optimal strategy is 0.30%.