Symbolic Reasoning for Hearthstone
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 Hearthst...
Gespeichert in:
Veröffentlicht in: | IEEE transactions on games 2018-06, Vol.10 (2), p.113-127 |
---|---|
Hauptverfasser: | , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | 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. |
---|---|
ISSN: | 2475-1502 2475-1510 |
DOI: | 10.1109/TCIAIG.2017.2706745 |