{"title":"Skill Dominance Analysis of Two(Four) player, Four(Five) dice Variant of the Ludo Game","authors":"Tathagata Banerjee, Diganta Mukherjee","doi":"arxiv-2409.00376","DOIUrl":null,"url":null,"abstract":"This paper examines two different variants of the Ludo game, involving\nmultiple dice and a fixed number of total turns. Within each variant, multiple\ngame lengths (total no. of turns) are considered. To compare the two variants,\na set of intuitive, rule-based strategies is designed, representing different\nbroad methods of strategic play. Game play is simulated between bots (automated\nsoftware applications executing repetitive tasks over a network) following\nthese strategies. The expected results are computed using certain game\ntheoretic and probabilistic explanations, helping to understand the performance\nof the different strategies. The different strategies are further analyzed\nusing win percentage in a large number of simulations, and Nash Equilibrium\nstrategies are computed for both variants for a varying number of total turns.\nThe Nash Equilibrium strategies across different game lengths are compared. A\nclear distinction between performances of strategies is observed, with more\nsophisticated strategies beating the naive one. A gradual shift in optimal\nstrategy profiles is observed with changing game length, and certain\nsophisticated strategies even confound each other's performance while playing\nagainst each other.","PeriodicalId":501316,"journal":{"name":"arXiv - CS - Computer Science and Game Theory","volume":"4 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Computer Science and Game Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2409.00376","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
This paper examines two different variants of the Ludo game, involving
multiple dice and a fixed number of total turns. Within each variant, multiple
game lengths (total no. of turns) are considered. To compare the two variants,
a set of intuitive, rule-based strategies is designed, representing different
broad methods of strategic play. Game play is simulated between bots (automated
software applications executing repetitive tasks over a network) following
these strategies. The expected results are computed using certain game
theoretic and probabilistic explanations, helping to understand the performance
of the different strategies. The different strategies are further analyzed
using win percentage in a large number of simulations, and Nash Equilibrium
strategies are computed for both variants for a varying number of total turns.
The Nash Equilibrium strategies across different game lengths are compared. A
clear distinction between performances of strategies is observed, with more
sophisticated strategies beating the naive one. A gradual shift in optimal
strategy profiles is observed with changing game length, and certain
sophisticated strategies even confound each other's performance while playing
against each other.