Exploring the hearthstone deck space

Aditya Bhatt, Scott Lee, Fernando De Mesentier Silva, Connor W. Watson, Julian Togelius, Amy K. Hoover

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Abstract

    A significant issue in game balancing is understanding the game itself. For simple games end-to-end optimization approaches can help explore the game's design space, but for more complex games it is necessary to isolate and explore its parts. Hearthstone, Blizzard's popular two-player turn-taking adversarial card game, has two distinct game-playing challenges: choosing when and how to play cards, and selecting which cards a player can access during the game (deckbuilding). Focusing on deckbuilding, four experiments are conducted to computationally explore the design of Hearthstone. They address the difficulty of constructing good decks, the specificity and generality of decks, and the transitivity of decks. Results suggest it is possible to find decks with an Evolution Strategy (ES) that convincingly beat other decks available in the game, but that they also exhibit some generality (i.e. they perform well against unknown decks). Interestingly, a second ES experiment is performed where decks are evolved against opponents playing the originally evolved decks. Since the originally evolved decks beat the starter decks, and the twice evolved decks beat the originally evolved decks, some degree of transitivity of the deck space is shown. While only a preliminary study with restrictive conditions, this paper paves the way for future work computationally identifying properties of cards important for different gameplay strategies and helping players build decks to fit their personal playstyles without the need for in-depth domain knowledge.

    Original languageEnglish (US)
    Title of host publicationProceedings of the 13th International Conference on the Foundations of Digital Games, FDG 2018
    EditorsSebastian Deterding, Mitu Khandaker, Sebastian Risi, Jose Font, Steve Dahlskog, Christoph Salge, Carl Magnus Olsson
    PublisherAssociation for Computing Machinery
    ISBN (Electronic)9781450365710
    DOIs
    StatePublished - Aug 7 2018
    Event13th International Conference on the Foundations of Digital Games, FDG 2018 - Malmo, Sweden
    Duration: Aug 7 2018Aug 10 2018

    Other

    Other13th International Conference on the Foundations of Digital Games, FDG 2018
    CountrySweden
    CityMalmo
    Period8/7/188/10/18

    Fingerprint

    Starters
    Experiments

    Keywords

    • Deck building
    • Evolution strategies
    • Evolutionary computation
    • Game balancing
    • Hearthstone

    ASJC Scopus subject areas

    • Human-Computer Interaction
    • Computer Networks and Communications
    • Computer Vision and Pattern Recognition
    • Software

    Cite this

    Bhatt, A., Lee, S., De Mesentier Silva, F., Watson, C. W., Togelius, J., & Hoover, A. K. (2018). Exploring the hearthstone deck space. In S. Deterding, M. Khandaker, S. Risi, J. Font, S. Dahlskog, C. Salge, & C. M. Olsson (Eds.), Proceedings of the 13th International Conference on the Foundations of Digital Games, FDG 2018 [18] Association for Computing Machinery. https://doi.org/10.1145/3235765.3235791

    Exploring the hearthstone deck space. / Bhatt, Aditya; Lee, Scott; De Mesentier Silva, Fernando; Watson, Connor W.; Togelius, Julian; Hoover, Amy K.

    Proceedings of the 13th International Conference on the Foundations of Digital Games, FDG 2018. ed. / Sebastian Deterding; Mitu Khandaker; Sebastian Risi; Jose Font; Steve Dahlskog; Christoph Salge; Carl Magnus Olsson. Association for Computing Machinery, 2018. 18.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Bhatt, A, Lee, S, De Mesentier Silva, F, Watson, CW, Togelius, J & Hoover, AK 2018, Exploring the hearthstone deck space. in S Deterding, M Khandaker, S Risi, J Font, S Dahlskog, C Salge & CM Olsson (eds), Proceedings of the 13th International Conference on the Foundations of Digital Games, FDG 2018., 18, Association for Computing Machinery, 13th International Conference on the Foundations of Digital Games, FDG 2018, Malmo, Sweden, 8/7/18. https://doi.org/10.1145/3235765.3235791
    Bhatt A, Lee S, De Mesentier Silva F, Watson CW, Togelius J, Hoover AK. Exploring the hearthstone deck space. In Deterding S, Khandaker M, Risi S, Font J, Dahlskog S, Salge C, Olsson CM, editors, Proceedings of the 13th International Conference on the Foundations of Digital Games, FDG 2018. Association for Computing Machinery. 2018. 18 https://doi.org/10.1145/3235765.3235791
    Bhatt, Aditya ; Lee, Scott ; De Mesentier Silva, Fernando ; Watson, Connor W. ; Togelius, Julian ; Hoover, Amy K. / Exploring the hearthstone deck space. Proceedings of the 13th International Conference on the Foundations of Digital Games, FDG 2018. editor / Sebastian Deterding ; Mitu Khandaker ; Sebastian Risi ; Jose Font ; Steve Dahlskog ; Christoph Salge ; Carl Magnus Olsson. Association for Computing Machinery, 2018.
    @inproceedings{4f373c09b7cf487bae12f7996bc133dc,
    title = "Exploring the hearthstone deck space",
    abstract = "A significant issue in game balancing is understanding the game itself. For simple games end-to-end optimization approaches can help explore the game's design space, but for more complex games it is necessary to isolate and explore its parts. Hearthstone, Blizzard's popular two-player turn-taking adversarial card game, has two distinct game-playing challenges: choosing when and how to play cards, and selecting which cards a player can access during the game (deckbuilding). Focusing on deckbuilding, four experiments are conducted to computationally explore the design of Hearthstone. They address the difficulty of constructing good decks, the specificity and generality of decks, and the transitivity of decks. Results suggest it is possible to find decks with an Evolution Strategy (ES) that convincingly beat other decks available in the game, but that they also exhibit some generality (i.e. they perform well against unknown decks). Interestingly, a second ES experiment is performed where decks are evolved against opponents playing the originally evolved decks. Since the originally evolved decks beat the starter decks, and the twice evolved decks beat the originally evolved decks, some degree of transitivity of the deck space is shown. While only a preliminary study with restrictive conditions, this paper paves the way for future work computationally identifying properties of cards important for different gameplay strategies and helping players build decks to fit their personal playstyles without the need for in-depth domain knowledge.",
    keywords = "Deck building, Evolution strategies, Evolutionary computation, Game balancing, Hearthstone",
    author = "Aditya Bhatt and Scott Lee and {De Mesentier Silva}, Fernando and Watson, {Connor W.} and Julian Togelius and Hoover, {Amy K.}",
    year = "2018",
    month = "8",
    day = "7",
    doi = "10.1145/3235765.3235791",
    language = "English (US)",
    editor = "Sebastian Deterding and Mitu Khandaker and Sebastian Risi and Jose Font and Steve Dahlskog and Christoph Salge and Olsson, {Carl Magnus}",
    booktitle = "Proceedings of the 13th International Conference on the Foundations of Digital Games, FDG 2018",
    publisher = "Association for Computing Machinery",

    }

    TY - GEN

    T1 - Exploring the hearthstone deck space

    AU - Bhatt, Aditya

    AU - Lee, Scott

    AU - De Mesentier Silva, Fernando

    AU - Watson, Connor W.

    AU - Togelius, Julian

    AU - Hoover, Amy K.

    PY - 2018/8/7

    Y1 - 2018/8/7

    N2 - A significant issue in game balancing is understanding the game itself. For simple games end-to-end optimization approaches can help explore the game's design space, but for more complex games it is necessary to isolate and explore its parts. Hearthstone, Blizzard's popular two-player turn-taking adversarial card game, has two distinct game-playing challenges: choosing when and how to play cards, and selecting which cards a player can access during the game (deckbuilding). Focusing on deckbuilding, four experiments are conducted to computationally explore the design of Hearthstone. They address the difficulty of constructing good decks, the specificity and generality of decks, and the transitivity of decks. Results suggest it is possible to find decks with an Evolution Strategy (ES) that convincingly beat other decks available in the game, but that they also exhibit some generality (i.e. they perform well against unknown decks). Interestingly, a second ES experiment is performed where decks are evolved against opponents playing the originally evolved decks. Since the originally evolved decks beat the starter decks, and the twice evolved decks beat the originally evolved decks, some degree of transitivity of the deck space is shown. While only a preliminary study with restrictive conditions, this paper paves the way for future work computationally identifying properties of cards important for different gameplay strategies and helping players build decks to fit their personal playstyles without the need for in-depth domain knowledge.

    AB - A significant issue in game balancing is understanding the game itself. For simple games end-to-end optimization approaches can help explore the game's design space, but for more complex games it is necessary to isolate and explore its parts. Hearthstone, Blizzard's popular two-player turn-taking adversarial card game, has two distinct game-playing challenges: choosing when and how to play cards, and selecting which cards a player can access during the game (deckbuilding). Focusing on deckbuilding, four experiments are conducted to computationally explore the design of Hearthstone. They address the difficulty of constructing good decks, the specificity and generality of decks, and the transitivity of decks. Results suggest it is possible to find decks with an Evolution Strategy (ES) that convincingly beat other decks available in the game, but that they also exhibit some generality (i.e. they perform well against unknown decks). Interestingly, a second ES experiment is performed where decks are evolved against opponents playing the originally evolved decks. Since the originally evolved decks beat the starter decks, and the twice evolved decks beat the originally evolved decks, some degree of transitivity of the deck space is shown. While only a preliminary study with restrictive conditions, this paper paves the way for future work computationally identifying properties of cards important for different gameplay strategies and helping players build decks to fit their personal playstyles without the need for in-depth domain knowledge.

    KW - Deck building

    KW - Evolution strategies

    KW - Evolutionary computation

    KW - Game balancing

    KW - Hearthstone

    UR - http://www.scopus.com/inward/record.url?scp=85055558109&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=85055558109&partnerID=8YFLogxK

    U2 - 10.1145/3235765.3235791

    DO - 10.1145/3235765.3235791

    M3 - Conference contribution

    BT - Proceedings of the 13th International Conference on the Foundations of Digital Games, FDG 2018

    A2 - Deterding, Sebastian

    A2 - Khandaker, Mitu

    A2 - Risi, Sebastian

    A2 - Font, Jose

    A2 - Dahlskog, Steve

    A2 - Salge, Christoph

    A2 - Olsson, Carl Magnus

    PB - Association for Computing Machinery

    ER -