Modelling and solving English peg solitaire

DOI10.1016/j.cor.2005.01.018zbMath1086.90070OpenAlexW2122726981WikidataQ61632227 ScholiaQ61632227MaRDI QIDQ2489133

Ian Miguel, Christopher Jefferson, Angela Miguel, S. Armagan Tarim

Publication date: 16 May 2006

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2005.01.018

zbMATH Keywords

ModellingInteger programmingSymmetryPlanningConstraint programming

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Related Items (5)

On Complete S-Reachable Graphs ⋮ Implementing logical connectives in constraint programming ⋮ Generating custom propagators for arbitrary constraints ⋮ ON mRJ REACHABILITY IN TREES ⋮ On reachability in graphs with obstacles

Uses Software

• Mathematica
• STAN
• Walksat
• CPlan
• Chaff
• Graphplan

Cites Work

• Fast planning through planning graph analysis
• STRIPS: A new approach to the application of theorem proving to problem solving
• Planning as heuristic search
• On the binary solitaire cone
• Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Modelling and solving English peg solitaire