Visualizing Multiplayer Game Spaces

IEEE Transactions on Games(2022)

引用 1|浏览33
暂无评分
摘要
In this article, we compare four different “game spaces” in terms of their usefulness in characterizing multiplayer tabletop games, with a particular interest in any underlying change to a game’s characteristics as the number of players changes. In each case, we take a 16-D feature space and reduce it to a 2-D visualizable landscape. We find that a space obtained from optimization of parameters in Monte Carlo tree search is most directly interpretable to characterize our set of games in terms of the relative importance of imperfect information, adversarial opponents, and reward sparsity. These results do not correlate with a space defined using attributes of the game tree. This dimensionality reduction does not show any general effect as the number of players changes. Therefore, we consider the question using the original features to classify the games into two sets: 1) those for which the characteristics of the game change significantly as the number of players changes and 2) those for which there is no such effect.
更多
查看译文
关键词
Dimensionality reduction,Monte Carlo tree search (MCTS),multiplayer, $N$ -Tuple Bandit Evolutionary Algorithm (NTBEA)
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要