Quantitative Rule-Based Strategy modeling in Classic Indian Rummy: A Metric Optimization Approach
About
The 13-card variant of Classic Indian Rummy is a sequential game of incomplete information that requires probabilistic reasoning and combinatorial decision-making. This paper proposes a rule-based framework for strategic play, driven by a new hand-evaluation metric termed MinDist. The metric modifies the MinScore metric by quantifying the edit distance between a hand and the nearest valid configuration, thereby capturing structural proximity to completion. We design a computationally efficient algorithm derived from the MinScore algorithm, leveraging dynamic pruning and pattern caching to exactly calculate this metric during play. Opponent hand-modeling is also incorporated within a two-player zero-sum simulation framework, and the resulting strategies are evaluated using statistical hypothesis testing. Empirical results show significant improvement in win rates for MinDist-based agents over traditional heuristics, providing a formal and interpretable step toward algorithmic Rummy strategy design.
Related benchmarks
| Task | Dataset | Result | Rank | |
|---|---|---|---|---|
| Indian Rummy | Indian Rummy vs. MinScoreAgent v1 (test) | Win Rate61 | 12 | |
| Inference Latency | Indian Rummy | Latency (ms)0.05 | 7 | |
| Indian Rummy | Indian Rummy vs. RandomAgent v1 (test) | Win Rate99.7 | 6 | |
| Indian Rummy | Indian Rummy vs. MinScoreOppAgent v1 (test) | Win Rate60.4 | 6 | |
| Indian Rummy | Indian Rummy vs. MinDistAgent v1 (test) | Win Rate51 | 6 | |
| Indian Rummy | Indian Rummy (vs. MinDistOppAgent) v1 (test) | Win Rate49.5 | 6 |