Details
| Originalsprache | Englisch |
|---|---|
| Seiten (von - bis) | 1207-1217 |
| Seitenumfang | 11 |
| Fachzeitschrift | International Journal of Computational Intelligence Systems |
| Jahrgang | 13 |
| Ausgabenummer | 1 |
| Frühes Online-Datum | 18 Aug. 2020 |
| Publikationsstatus | Veröffentlicht - 2020 |
| Extern publiziert | Ja |
Abstract
Search-based agents have shown to perform well in many game-based applications. In the context of partially-observable sce-narios agent’s require the state to be fully determinized. Especially in case of collectible cards games, the sheer number of decks constructed by players hinder an agent to reliably estimate the game’s current state, and therefore, renders the search ineffective. In this paper, we propose the use of a (fuzzy) multiset representation to describe frequently played decks. Extracted deck prototypes have shown to match human expert labels well and seem to serve as an efficient abstraction of the deck space. We further show that such deck prototypes allow the agent to predict upcoming cards with high accuracy, therefore, allowing more accurate sampling procedures for search-based agents.
ASJC Scopus Sachgebiete
- Informatik (insg.)
- Allgemeine Computerwissenschaft
- Mathematik (insg.)
- Computational Mathematics
Zitieren
- Standard
- Harvard
- Apa
- Vancouver
- BibTex
- RIS
in: International Journal of Computational Intelligence Systems, Jahrgang 13, Nr. 1, 2020, S. 1207-1217.
Publikation: Beitrag in Fachzeitschrift › Artikel › Forschung › Peer-Review
}
TY - JOUR
T1 - Predicting cards using a fuzzy multiset clustering of decks
AU - Dockhorn, Alexander
AU - Kruse, Rudolf
PY - 2020
Y1 - 2020
N2 - Search-based agents have shown to perform well in many game-based applications. In the context of partially-observable sce-narios agent’s require the state to be fully determinized. Especially in case of collectible cards games, the sheer number of decks constructed by players hinder an agent to reliably estimate the game’s current state, and therefore, renders the search ineffective. In this paper, we propose the use of a (fuzzy) multiset representation to describe frequently played decks. Extracted deck prototypes have shown to match human expert labels well and seem to serve as an efficient abstraction of the deck space. We further show that such deck prototypes allow the agent to predict upcoming cards with high accuracy, therefore, allowing more accurate sampling procedures for search-based agents.
AB - Search-based agents have shown to perform well in many game-based applications. In the context of partially-observable sce-narios agent’s require the state to be fully determinized. Especially in case of collectible cards games, the sheer number of decks constructed by players hinder an agent to reliably estimate the game’s current state, and therefore, renders the search ineffective. In this paper, we propose the use of a (fuzzy) multiset representation to describe frequently played decks. Extracted deck prototypes have shown to match human expert labels well and seem to serve as an efficient abstraction of the deck space. We further show that such deck prototypes allow the agent to predict upcoming cards with high accuracy, therefore, allowing more accurate sampling procedures for search-based agents.
KW - Clustering
KW - Deck analysis
KW - Fuzzy multisets
KW - Hearthstone
UR - http://www.scopus.com/inward/record.url?scp=85091479000&partnerID=8YFLogxK
U2 - 10.2991/ijcis.d.200805.001
DO - 10.2991/ijcis.d.200805.001
M3 - Article
AN - SCOPUS:85091479000
VL - 13
SP - 1207
EP - 1217
JO - International Journal of Computational Intelligence Systems
JF - International Journal of Computational Intelligence Systems
SN - 1875-6891
IS - 1
ER -