Quantitative Rule-Based Strategy modeling in Classic Indian Rummy: A Metric Optimization Approach
By: Purushottam Saha , Avirup Chakraborty , Sourish Sarkar and more
Potential Business Impact:
Makes computers play Rummy better than people.
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.
Similar Papers
Adapting Skill Ratings to Luck-Based Hidden-Information Games
CS and Game Theory
Rates Rummy players better by including luck.
Metric Distortion with Preference Intensities
CS and Game Theory
Lets voters show how much they like choices.
Outer-Learning Framework for Playing Multi-Player Trick-Taking Card Games: A Case Study in Skat
Artificial Intelligence
AI learns card games better by playing itself.