Chaff: engineering an efficient SAT solver
Proceedings of the 38th annual Design Automation Conference
Readings in Planning
Complexity results for standard benchmark domains in planning
Artificial Intelligence
Unifying SAT-based and Graph-based Planning
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Modelling and solving English Peg Solitaire
Computers and Operations Research
The FF planning system: fast plan generation through heuristic search
Journal of Artificial Intelligence Research
Dual modelling of permutation and injection problems
Journal of Artificial Intelligence Research
Fast planning through planning graph analysis
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Mapping problems with finite-domain variables to problems with boolean variables
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Theoretical Computer Science
Implementing logical connectives in constraint programming
Artificial Intelligence
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Hi-index | 0.00 |
We present an evaluation of different AI search paradigms applied to a natural planning problem. The problem we investigate is a particular card game for one player called Black Hole. For paradigms such as SAT and Constraint Programming, the game has the particular advantage that all solutions are the same length. We show that a general version of Black Hole is NP-complete. Then we report on the application of a number of AI paradigms to the problem, namely Planning, Constraint Programming, SAT, Mixed-Integer Programming and a specialised solver. An important feature of Black Hole is the presence of symmetries which arise during the search process. We show that tackling these can improve search dramatically, as can caching states that occur during search. Our implementations as SAT, Constraint Programming and Planning problems are efficient and competitive, allowing detailed empirical evaluation of the strengths and weaknesses of each methodology. Our empirical evaluation shows that Black Hole is winnable approximately 87% of the time, and that given instances can be trivially solved, easy to solve, hard to solve and even intractable, depending on the AI methodology used to obtain solutions.