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
CITATION STYLE
Hoshino, R., & Kahn, M. (2019). Predicting unsolvable deals in the birds of a feather solitaire game. In 33rd AAAI Conference on Artificial Intelligence, AAAI 2019, 31st Innovative Applications of Artificial Intelligence Conference, IAAI 2019 and the 9th AAAI Symposium on Educational Advances in Artificial Intelligence, EAAI 2019 (pp. 9748–9749). AAAI Press. https://doi.org/10.1609/aaai.v33i01.33019748
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
