二(四)人四(五)骰子鲁多游戏变体的技能优势分析

Tathagata Banerjee, Diganta Mukherjee
{"title":"二(四)人四(五)骰子鲁多游戏变体的技能优势分析","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":"{\"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}","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

摘要

本文研究了鲁多游戏的两种不同变体,涉及多个骰子和固定的总回合数。在每种变体中,都考虑了多种游戏长度(总回合数)。为了比较这两种变体,我们设计了一套基于规则的直观策略,代表了不同的策略游戏方法。我们模拟了机器人(通过网络执行重复性任务的自动化软件应用程序)之间按照这些策略进行的博弈。使用某些游戏理论和概率论解释来计算预期结果,有助于理解不同策略的性能。在大量模拟中,使用胜率对不同策略进行了进一步分析,并计算了两种变体在不同总回合数下的纳什均衡策略。我们观察到了不同策略之间的明显区别,更复杂的策略战胜了更幼稚的策略。随着博弈长度的变化,最优策略也逐渐发生了变化,某些复杂策略甚至在相互博弈时混淆了彼此的表现。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Skill Dominance Analysis of Two(Four) player, Four(Five) dice Variant of the Ludo Game
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
MALADY: Multiclass Active Learning with Auction Dynamics on Graphs Mechanism Design for Extending the Accessibility of Facilities Common revenue allocation in DMUs with two stages based on DEA cross-efficiency and cooperative game The common revenue allocation based on modified Shapley value and DEA cross-efficiency On Robustness to $k$-wise Independence of Optimal Bayesian Mechanisms
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1