Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 57 min ago
Peer-reviewedCC BYScientific Reports

Heuristic optimization of AI agents for Dhumbal

  1. 1Department of Mathematics, Kathmandu University

Abstract

This study evaluates Artificial Intelligence (AI) agents for Dhumbal, a culturally significant multiplayer card game with imperfect information, by systematically comparing rule-based, search-based, and learning-based strategies. We formalize Dhumbal’s mechanics and implement diverse agents, including heuristic approaches (Aggressive, Conservative, Balanced, Opportunistic), search-based methods such as Monte Carlo Tree Search (MCTS) and Information Set Monte Carlo Tree Search (ISMCTS), reinforcement learning approaches, including Deep Q-Network (DQN) and Proximal Policy Optimization (PPO), and a random baseline. Evaluation uses multiple tournaments, each comprising independently shuffled rounds, while accounting for dependence among agents’ outcomes within each round. Performance is measured via win rate, economic outcome, Jhyap success, cards discarded per round, risk assessment, and decision efficiency. Primary comparisons rely on effect sizes (Cohen’s d), 95% confidence intervals, and a round-level bootstrap sensitivity analysis. Across 1024 simulated rounds, the rule-based Aggressive agent achieves the highest win rate (88.9%, 95% CI: [86.9, 90.8]), outperforming ISMCTS (9.3%) and PPO (0.2%) under the evaluated configurations. The study contributes a reproducible AI framework, insights into heuristic efficacy under partial information, a discussion of the ethical risks of deploying dominant agents in a game traditionally played for money, and open-source code, thereby advancing AI research and supporting digital preservation of cultural games.

Related

  1. Multi-objective student nurse allocation problem during training using exact and hybrid heuristic–metaheuristic methods
    Hanieh Shabani Afarani, Arezoo Atighehchian, Roghieh Nazari
    Scientific ReportsPeer-reviewedCC BYFull textGeneral medicineDOAJ
  2. Reducing Cranial Morphology Error in F3 Scalp Localization: Comparison of Heuristic and Regression‐Based Methods
    Rosa Pàmies‐Vilà, Laia Mallol‐Bordas, Vicenç Pascual‐Rubio +1
    Brain and BehaviorPeer-reviewedCC BYFull textNeurologyDOAJ
  3. Simulating Patient Resistance in silico: Evaluating Concepts in Rare Diseases using Patient Agents with Limited Rationality
    Robin Vivian
    PriMera Scientific EngineeringPeer-reviewedLicence not statedFull textEpidemiology & public healthHAL
  4. AI conversational agents as population health infrastructure: promise, peril, and the case for public-interest design
    Meghna Rajan
    Frontiers in Public HealthPeer-reviewedCC BY 4.0Full textEpidemiology & public healthPMCCrossrefEurope PMC
  5. From routine adjunct to selective rescue: interpreting randomized evidence on hemostatic agents in robotic partial nephrectomy.
    Masaki Nakamura
    Translational andrology and urologyPeer-reviewedCC BY-NC-NDFull textOncologyEurope PMC
BibTeX
@article{malla2026heuristic,
  title = {{Heuristic optimization of AI agents for Dhumbal}},
  author = {Sahaj Raj Malla},
  journal = {Scientific Reports},
  year = {2026},
  month = aug,
  doi = {10.1038/s41598-026-68206-1},
  url = {https://doi.org/10.1038/s41598-026-68206-1},
  note = {CC BY},
}
RIS
TY  - JOUR
TI  - Heuristic optimization of AI agents for Dhumbal
AU  - Sahaj Raj Malla
PY  - 2026
DA  - 2026/08/01
JO  - Scientific Reports
DO  - 10.1038/s41598-026-68206-1
UR  - https://doi.org/10.1038/s41598-026-68206-1
AB  - This study evaluates Artificial Intelligence (AI) agents for Dhumbal, a culturally significant multiplayer card game with imperfect information, by systematically comparing rule-based, search-based, and learning-based strategies. We formalize Dhumbal’s mechanics and implement diverse agents, including heuristic approaches (Aggressive, Conservative, Balanced, Opportunistic), search-based methods such as Monte Carlo Tree Search (MCTS) and Information Set Monte Carlo Tree Search (ISMCTS), reinforcement learning approaches, including Deep Q-Network (DQN) and Proximal Policy Optimization (PPO), and a random baseline. Evaluation uses multiple tournaments, each comprising independently shuffled rounds, while accounting for dependence among agents’ outcomes within each round. Performance is measured via win rate, economic outcome, Jhyap success, cards discarded per round, risk assessment, and decision efficiency. Primary comparisons rely on effect sizes (Cohen’s d), 95% confidence intervals, and a round-level bootstrap sensitivity analysis. Across 1024 simulated rounds, the rule-based Aggressive agent achieves the highest win rate (88.9%, 95% CI: [86.9, 90.8]), outperforming ISMCTS (9.3%) and PPO (0.2%) under the evaluated configurations. The study contributes a reproducible AI framework, insights into heuristic efficacy under partial information, a discussion of the ethical risks of deploying dominant agents in a game traditionally played for money, and open-source code, thereby advancing AI research and supporting digital preservation of cultural games.
SN  - 2045-2322
ER  -