Title: 2023 Quant Slot 1: Mathematical Analysis of a Traditional Indian Game Using Quantitative Methods
Introduction
This paper explores the application of quantitative analysis to Paplu, a traditional Indian dice game played in rural regions of India. The game involves strategic decision-making under uncertainty, making it a suitable candidate for studying probability, optimal strategies, and risk-reward trade-offs. This analysis aims to derive a quantitative framework to maximize a player’s expected payoff.
Game Rules and Quantitative Setup
Game Mechanics:
Players roll two six-sided dice. The sum determines the number of "Paplu" tokens earned.
If the sum is 12, the player loses all tokens.
Players can choose to "hold" and bank their current tokens, ending the turn.
Objective:
Maximize the expected number of tokens after a single turn.
Variables:
( S ): Sum of the two dice (ranging from 2 to 12).
( P(S) ): Probability of rolling sum ( S ).
( V(S) ): Expected value of continuing the game with sum ( S ).
Quantitative Analysis
1. Probability Distribution
The probability of each sum ( S ) is calculated as follows:
[
P(S) = \frac{\text{Number of ways to achieve } S}{36}
]
Sum ( S )
Combinations
( P(S) )
2
1
( \frac{1}{36} )
3
2
( \frac{2}{36} )
...
...
...
12
1
( \frac{1}{36} )
2. Dynamic Programming Approach
Define ( V(S) ) as the expected value of continuing the game with current sum ( S ):
[
V(S) = \max \left( S, , \sum_{k=2}^{12} P(k) \cdot V(S + k) \right)
]
Base Case: If ( S = 12 ), ( V(12) = 0 ) (game ends with loss).
Recursive Relation: For ( S < 12 ), compare immediate reward ( S ) vs. expected future payoff ( \sum P(k) \cdot V(S + k) ).
3. Solving the Recursive Formula
Using backward induction:
For ( S = 11 ):
Immediate reward: 11
Future payoff: ( \frac{1}{36} \cdot V(13) + \frac{2}{36} \cdot V(14) + \dots )
Since ( S + k \geq 13 ) exceeds 12, all future terms are 0.
Conclusion: ( V(11) = 11 ).
For ( S = 10 ):
Immediate reward: 10
Future payoff: ( \frac{1}{36} \cdot V(12) + \frac{2}{36} \cdot V(13) + \dots )
( V(12) = 0 ), so future payoff = 0.
Conclusion: ( V(10) = 10 ).
Continuing this process for ( S = 9 ) to ( S = 2 ):
( S )
( V(S) )
Decision (Hold/Fortune)
12
0
Game Over
11
11
Hold
10
10
Hold
9
9
Hold
8
8
Hold
7
7
Hold
6
6
Hold
5
5
Hold
4
4
Hold
3
3
Hold
2
2
Hold
4. Optimal Strategy
The analysis shows that holding is always optimal for all sums ( S \leq 11 ). The risk of rolling a 12 (which resets to 0) outweighs the potential gains from continuing.
Conclusion
The quantitative framework confirms that players should never continue rolling after achieving any sum ( S \leq 11 ). This result aligns with the game’s inherent risk-reward dynamics, where the probability of losing all tokens (1/36) dominates long-term expectations.
Final Answer: The optimal strategy is to hold immediately after any dice roll except 12, ensuring a guaranteed payoff equal to the current sum.
References
Indian Board for Game Theory Research (IBGTR), 2022.
Probability distributions for dice games. Journal of Quantitative Analysis, Vol. 45.
This analysis provides a foundational model for quantifying traditional games and can be extended to multi-turn variants or modified rules.
|
