Taking Chances: The Analysis of Simplified Parcheesi

Parcheesi is a compelling example of a two-player, strictly competitive game of perfect information with chance moves. In this game, there are only two possible outcomes: W (a win for Player I and a loss for Player II) or L (a loss for Player I and a win for Player II). The primary motivation for a rational player is to maximize the probability of winning. Parcheesi is played between Player I (White) and Player II (Black) on a (2 m + 1) × n board. The central cell in the first column of the board is shaded, marking the winning square. The objective is to be the first to reach this shaded square by following specific routes and rules. In this paper, we will focus on three board configurations: the 3 × 2, 3 × 3, and 5 × 2 boards. For the first two configurations, we will provide brief solutions. A comprehensive analysis will be dedicated to the 5 × 2 board. Finally, we will conclude with a conjecture regarding the general (2 n + 1) × 2 board configuration.

Authors

Institutions

Publication Details

Journal
Model Assisted Statistics and Applications
Published
2024-11-01
DOI
https://doi.org/10.1177/15741699241306824
Primary Topic
Computability, Logic, AI Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Taking Chances: The Analysis of Simplified Parcheesi

Aden Ahmed
Model Assisted Statistics and Applications
Computability, Logic, AI Algorithms
article

Taking Chances: The Analysis of Simplified Parcheesi

Aden Ahmed
article en

Abstract

Parcheesi is a compelling example of a two-player, strictly competitive game of perfect information with chance moves. In this game, there are only two possible outcomes: W (a win for Player I and a loss for Player II) or L (a loss for Player I and a win for Player II). The primary motivation for a rational player is to maximize the probability of winning. Parcheesi is played between Player I (White) and Player II (Black) on a (2 m + 1) × n board. The central cell in the first column of the board is shaded, marking the winning square. The objective is to be the first to reach this shaded square by following specific routes and rules. In this paper, we will focus on three board configurations: the 3 × 2, 3 × 3, and 5 × 2 boards. For the first two configurations, we will provide brief solutions. A comprehensive analysis will be dedicated to the 5 × 2 board. Finally, we will conclude with a conjecture regarding the general (2 n + 1) × 2 board configuration.

Model Assisted Statistics and ApplicationsVol. 19(4)
Texas A&M University – Kingsville (US)
Openalex Percentile: Top 69%
Computability, Logic, AI Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.