arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2407.21178cs.AI
收藏

推理游戏框架与信息集熵搜索

Deduction Game Framework and Information Set Entropy Search

Queen Mary University of London(伦敦玛丽女王大学)

Fandi Meng, Simon Lucas

AI总结:

本文提出推理游戏框架与信息集熵搜索算法,通过香农熵变化实现可解释决策,在八个游戏上显著优于SO-ISMCTS。

摘要:

我们提出了一个专为推理游戏设计的游戏框架,能够从香农熵变化的角度进行结构化分析。此外,我们引入了一种新的前向搜索算法——信息集熵搜索(ISES),该算法能够有效求解许多单人推理游戏。ISES算法结合采样技术后,使智能体能够在受控的计算资源和时间约束下做出决策。在我们框架内的八个游戏上的实验结果表明,在有限的决策时间约束下,我们的方法显著优于单观察者信息集蒙特卡洛树搜索(SO-ISMCTS)算法。我们框架中游戏状态的熵变化支持可解释的决策制定,同时也可用于分析推理游戏的吸引力,并为游戏设计者提供见解。

英文摘要:

We present a game framework tailored for deduction games, enabling structured analysis from the perspective of Shannon entropy variations. Additionally, we introduce a new forward search algorithm, Information Set Entropy Search (ISES), which effectively solves many single-player deduction games. The ISES algorithm, augmented with sampling techniques, allows agents to make decisions within controlled computational resources and time constraints. Experimental results on eight games within our framework demonstrate the significant superiority of our method over the Single Observer Information Set Monte Carlo Tree Search(SO-ISMCTS) algorithm under limited decision time constraints. The entropy variation of game states in our framework enables explainable decision-making, which can also be used to analyze the appeal of deduction games and provide insights for game designers.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑