不断发展的收藏纸牌游戏评估函数AI
Evolving Evaluation Functions for Collectible Card Game AI
摘要:
在这项工作中,我们提出了一项研究,关于两个重要方面的发展特征为基础的游戏评价功能:选择基因组表示和选择对手用于测试模型。我们比较了三种表现形式。一个更简单和更有限的,基于在预定义的游戏特征的线性组合中使用的权重向量。还有两个更复杂的,基于二叉树和n叉树。在这个测试的基础上,我们还研究了适应度的影响,适应度被定义为一个基于模拟的函数:与固定的弱对手比赛,与固定的强对手比赛,以及与来自先前种群的最佳个体比赛。对于一个测试平台,我们选择了一个最近流行的数字收藏卡游戏领域。我们在一个编程游戏中编码我们的实验,代码和魔术的传奇,用于战略纸牌游戏AI比赛。然而,由于所述问题具有普遍性,我们相信我们的观察也适用于其他领域。
英文摘要:
In this work, we presented a study regarding two important aspects of evolving feature-based game evaluation functions: the choice of genome representation and the choice of opponent used to test the model. We compared three representations. One simpler and more limited, based on a vector of weights that are used in a linear combination of predefined game features. And two more complex, based on binary and n-ary trees. On top of this test, we also investigated the influence of fitness defined as a simulation-based function that: plays against a fixed weak opponent, plays against a fixed strong opponent, and plays against the best individual from the previous population. For a testbed, we have chosen a recently popular domain of digital collectible card games. We encoded our experiments in a programming game, Legends of Code and Magic, used in Strategy Card Game AI Competition. However, as the problems stated are of general nature we are convinced that our observations are applicable in the other domains as well.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。