Determining Solvability in the Birds of a Feather Card Game

Shuto Araki, Juan Pablo Arenas Uribe, Zach Wilkerson, Steven Bogaerts, Chad Byers

AAAI 2019 pp. 9627-9634

doi:10.1609/AAAI.V33I01.33019627 /aaai/2019/araki2019aaai-determining/

Abstract

Birds of a Feather is a single-player card game in which cards are arranged in a grid. The player attempts to combine stacks of cards under certain rules, with the goal being to combine all cards into a single stack. This paper highlights several approaches for efficiently classifying whether a randomlychosen state has a single-stack solution. These approaches use graph theory and machine learning concepts to prune a state’s search space, resulting in significant reductions in runtime relative to a baseline search.

PDF AAAI Semantic Scholar

Cite

Text

Araki et al. "Determining Solvability in the Birds of a Feather Card Game." AAAI Conference on Artificial Intelligence, 2019. doi:10.1609/AAAI.V33I01.33019627

Markdown

[Araki et al. "Determining Solvability in the Birds of a Feather Card Game." AAAI Conference on Artificial Intelligence, 2019.](https://mlanthology.org/aaai/2019/araki2019aaai-determining/) doi:10.1609/AAAI.V33I01.33019627

BibTeX

@inproceedings{araki2019aaai-determining,
  title     = {{Determining Solvability in the Birds of a Feather Card Game}},
  author    = {Araki, Shuto and Uribe, Juan Pablo Arenas and Wilkerson, Zach and Bogaerts, Steven and Byers, Chad},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {2019},
  pages     = {9627-9634},
  doi       = {10.1609/AAAI.V33I01.33019627},
  url       = {https://mlanthology.org/aaai/2019/araki2019aaai-determining/}
}