Predicting Unsolvable Deals in the Birds of a Feather Solitaire Game
Abstract
In this paper, we analyze Birds of a Feather (BoaF), a solitaire game played with 16 cards. While the large majority of deals are solvable, the set of unsolvable deals share certain characteristics that can be determined from the adjacency matrix of the corresponding “compatibility graph”. We create a binary decision tree based on just three variables to predict whether a given deal is solvable. Our predictive model, tested on 30,000 random deals, correctly classifies over 99.9% of our data.
Cite
Text
Hoshino and Kahn. "Predicting Unsolvable Deals in the Birds of a Feather Solitaire Game." AAAI Conference on Artificial Intelligence, 2019. doi:10.1609/AAAI.V33I01.33019748Markdown
[Hoshino and Kahn. "Predicting Unsolvable Deals in the Birds of a Feather Solitaire Game." AAAI Conference on Artificial Intelligence, 2019.](https://mlanthology.org/aaai/2019/hoshino2019aaai-predicting/) doi:10.1609/AAAI.V33I01.33019748BibTeX
@inproceedings{hoshino2019aaai-predicting,
title = {{Predicting Unsolvable Deals in the Birds of a Feather Solitaire Game}},
author = {Hoshino, Richard and Kahn, Maximilian},
booktitle = {AAAI Conference on Artificial Intelligence},
year = {2019},
pages = {9748-9749},
doi = {10.1609/AAAI.V33I01.33019748},
url = {https://mlanthology.org/aaai/2019/hoshino2019aaai-predicting/}
}