Symbolic Reasoning for Hearthstone

被引:8
|
作者
Stiegler, Andreas [1 ]
Dahal, Keshav P. [2 ,3 ]
Maucher, Johannes [1 ]
Livingstone, Daniel [4 ]
机构
[1] Stuttgart Media Univ, D-70569 Stuttgart, Germany
[2] Univ West Scotland, Paisley PA1 2BE, Renfrew, Scotland
[3] Nanjing Univ Informat Sci & Technol, Nanjing 210044, Jiangsu, Peoples R China
[4] Glasgow Sch Art, Glasgow G3 6RQ, Lanark, Scotland
关键词
Context awareness; expert systems; inference mechanisms; knowledge based systems; knowledge representation; Monte Carlo methods; IMPERFECT INFORMATION;
D O I
10.1109/TCIAIG.2017.2706745
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Trading-card games are an interesting problem domain for Game AI, as they feature some challenges, such as highly variable game mechanics, that are not encountered in this intensity in many other genres. We present an expert system forming a player-level AI for the digital trading-card game Hearthstone. The bot uses a symbolic approach with a semantic structure, acting as an ontology, to represent both static descriptions of the game mechanics and dynamic game-state memories. Methods are introduced to reduce the amount of expert knowledge, such as popular moves or strategies, represented in the ontology, as the bot should derive such decisions in a symbolic way from its knowledge base. We narrow down the problem domain, selecting the relevant aspects for a play-to-win bot approach and comparing an ontology-driven approach to other approaches such as machine learning and case-based reasoning. On this basis, we describe how the semantic structure is linked with the game-state and how different aspects, such as memories, are encoded. An example illustrates how the bot, at runtime, uses rules and queries on the semantic structure combined with a simple utility system to do reasoning and strategic planning. Finally, an evaluation is presented that was conducted by fielding the bot against the stock "Expert" AI that Hearthstone is shipped with, as well as human opponents of various skill levels in order to assess how well the bot plays. A pseudo Turing test was used to evaluate the believability of the bot's reasoning.
引用
收藏
页码:113 / 127
页数:15
相关论文
共 50 条
  • [32] Reasoning over networks by symbolic methods
    Universität Passau, D-94030 Passau, Germany
    Appl Algebra Eng Commun Comput, 1 (79-96):
  • [33] Proof Complexity of Symbolic QBF Reasoning
    Mengel, Stefan
    Slivovsky, Friedrich
    THEORY AND APPLICATIONS OF SATISFIABILITY TESTING, SAT 2021, 2021, 12831 : 399 - 416
  • [34] An approach to class reasoning in symbolic computation
    Cioni, G
    Colagrossi, A
    Temperini, M
    DESIGN AND IMPLEMENTATION OF SYMBOLIC COMPUTATION SYSTEMS, 1996, 1128 : 240 - 251
  • [35] Symbolic Graph Reasoning Meets Convolutions
    Liang, Xiaodan
    Hu, Zhiting
    Zhang, Hao
    Lin, Liang
    Xing, Eric P.
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 31 (NIPS 2018), 2018, 31
  • [36] Symbolic Computation in Automated Program Reasoning
    Kovacs, Laura
    FORMAL METHODS, FM 2023, 2023, 14000 : 3 - 9
  • [37] Symbolic Explanations of Generalized Fuzzy Reasoning
    Szalas, Andrzej
    SMART DIGITAL FUTURES 2014, 2014, 262 : 7 - 16
  • [38] Symbolic Reasoning for Automatic Signal Placement
    Ferles K.
    Van Geffen J.
    Dillig I.
    Smaragdakis Y.
    Oper Syst Rev ACM, 2020, 1 (64-76): : 64 - 76
  • [39] Monitoring Refinement via Symbolic Reasoning
    Emmi, Michael
    Enea, Constantin
    Hamza, Jad
    ACM SIGPLAN NOTICES, 2015, 50 (06) : 260 - 269
  • [40] Evolutionary Deckbuilding in HearthStone
    Garcia-Sanchez, Pablo
    Tonda, Alberto
    Squillero, Giovanni
    Mora, Antonio
    Merelo, Juan J.
    2016 IEEE CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND GAMES (CIG), 2016,