Modelling and solving English peg solitaire

DOI10.1016/J.COR.2005.01.018MaRDI QIDQ2489133zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Christopher Jefferson, Angela Miguel, Ian 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

Constraint programmingInteger programmingModellingPlanningSymmetry

Mathematics Subject Classification ID

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

Recommendations

• Solving triangular peg solitaire
• Constructing solvable graphs in peg solitaire
• Peg solitaire on graphs
• Making graphs solvable in peg solitaire
• scientific article; zbMATH DE number 1759686
• Peg solitaire game on Sierpinski graphs
• Freely solvable graphs in peg solitaire
• Diagonal peg solitaire
• A fresh look at peg solitaire
• Reversible peg solitaire on graphs

Cites work

• Fast planning through planning graph analysis
• scientific article; zbMATH DE number 3761989 (Why is no real title available?)
• scientific article; zbMATH DE number 1285155 (Why is no real title available?)
• scientific article; zbMATH DE number 1944407 (Why is no real title available?)
• scientific article; zbMATH DE number 2084699 (Why is no real title available?)
• On the binary solitaire cone
• Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP
• Planning as heuristic search
• STRIPS: A new approach to the application of theorem proving to problem solving
• The FF planning system: Fast plan generation through heuristic search

Cited in

(7)

• Generating custom propagators for arbitrary constraints
• On reachability in graphs with obstacles
• scientific article; zbMATH DE number 1759686 (Why is no real title available?)
• On \(m\)RJ reachability in trees
• On Complete S-Reachable Graphs
• Implementing logical connectives in constraint programming
• Plotting: a case study in lifted planning with constraints

Describes a project that uses

Uses Software

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2489133)