A Monte Carlo tree search player for birds of a feather solitaire

Date

2019

Journal Title

Journal ISSN

Volume Title

Publisher

PKP Publishing Services Network

Abstract

Artificial intelligence in games serves as an excellent platform for facilitating collaborative research with undergraduates. This paper explores several aspects of a research challenge proposed for a newly-developed variant of a solitaire game. We present multiple classes of game states that can be identified as solvable or unsolvable. We present a heuristic for quickly finding goal states in a game state search tree. Finally, we introduce a Monte Carlo Tree Search-based player for the solitaire variant that can win almost any solvable starting deal efficiently.

Description

Keywords

Artificial intelligence, Solitaire (Game)

Citation

Roberson, C., & Sperduto, K. (2019). A Monte Carlo Tree Search Player for Birds of a Feather Solitaire. Proceedings of the AAAI Conference on Artificial Intelligence, 33(01), 9700-9705. https://doi.org/10.1609/aaai.v33i01.33019700

Collections