Title
Efficient Solving of Birds of a Feather Puzzles
Roles
Student Authors
Connor Berson ’21, Gettysburg College
Jivan Kharel ’21, Gettysburg College
Ryan Smolik ’20, Gettysburg College
Document Type
Conference Material
Publication Date
7-17-2019
Department 1
Computer Science
Abstract
In this article, we describe the lessons learned in creating an efficient solver for the solitaire game Birds of a Feather. We introduce a new variant of depth-first search that we call best-n depth-first search that achieved a 99.56% reduction in search time over 100,000 puzzle seeds. We evaluate a number of potential node-ordering search features and pruning tests, perform an analysis of solvability prediction with such search features, and consider possible future research directions suggested by the most computationally expensive puzzle seeds encountered in our testing.
Copyright Note
This is the publisher's version of the work. This publication appears in Gettysburg College's institutional repository by permission of the copyright owner for personal use, not for redistribution.
DOI
10.1609/aaai.v33i01.33019686
Version
Version of Record
Recommended Citation
Neller, Todd, et al. "Efficient Solving of Birds of a Feather Puzzles." In Proceedings of the 33rd AAAI Conference on Artificial Intelligence (AAAI-19), Jan. 27-Feb 1, 2019, Honolulu, HI, 9686-9692. Palo Alto: AAAI Press.
Required Publisher's Statement
This article is also available on the publisher's website.
Comments
Presented at the 33rd AAAI Conference on Artificial Intelligence (AAAI-19), Honolulu, HI, January 27-February 1, 2019.