Modelling and solving English Peg Solitaire

Computers and Operations Research

Volumn 33, Issue 10, 2006, Pages 2935-2959

  Jefferson, Christopher ^a   Miguel, Angela ^a   Miguel, Ian ^a   Tarim, S Armagan ^b  

^a UNIVERSITY OF YORK   (United Kingdom)

^b HACETTEPE UNIVERSITY   (Turkey)

Author keywords

Constraint programming; Integer programming; Modelling; Planning; Symmetry

Indexed keywords

COMPUTER PROGRAMMING; COMPUTER SIMULATION; CONSTRAINT THEORY; INTEGER PROGRAMMING; PLANNING;

CONSTRAINT PROGRAMMING; MODELING; PEG SOLITAIRE; SYMMETRY;

PROBLEM SOLVING;

EID: 32044434438     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2005.01.018     Document Type: Article

References (26)

1. J.D. Beasley The ins and outs of peg solitaire 1992 Oxford University Press Oxford
2. R. Uehara, and S. Iwata Generalized hi-Q is np-complete Transactions of IEICE 73 1990 270 273
3. N.G. de Bruijn A solitaire game and its relation to a finite field Journal of Recreational Mathematics 5 1972 133 137
4. Berlekamp ER, Conway JH, Guy RK. Winning ways for your mathematical plays, vol. 2: games in particular. London: Academic Press; 1982. p. 729-30.
5. Avis D, Deza A. On the boolean solitaire cone. Technical report, McGill University and Tokyo Institute of Technology, 1999.
6. C. Moore, and D. Eppstein One-dimensional peg solitaire, and duotaire R.J. Nowalski More games of no chance 2000 Cambridge University Press Cambridge 341 350
7. Beeler M, Gosper RW, Schroeppel R. HAKMEM. Technical report, MIT, Artificial Intelligence Laboratory, Memo AIM-239; 1972.
8. J. Allen, J. Hendler, and A. Tate Readings in planning 1990 Morgan Kaufmann Los Altos, CA
9. H. Kautz, and J.P. Walser State-space planning by integer optimization Proceedings of the 16th national conference on artificial intelligence 1999 526 533
10. T. Vossen, M. Ball, A. Lotem, and D. Nau Applying integer programming to AI planning Knowledge Engineering Review 16 2001 85 100
11. Haas A. The case for domain-specific frame axioms. Proceedings of the workshop on the frame problem in artificial intelligence, 1987.
12. Bockmayr A, Dimopoulos Y. Mixed integer programming models for planning problems. Proceedings of the CP98 workshop on constraint problem reformulation, 1998.
13. Jefferson C, Miguel A, Miguel I, Tarim A. Modelling and solving english peg solitaire. Proceedings of the 5th international workshop on integration of AI and OR techniques in constraint programming for combinatorial optimization problems (CPAIOR), 2003. p. 261-75.
14. H. Kautz, and B. Selman Pushing the envelope planning, propositional logic, and stochastic search Proceedings of the 13th national conference on artificial intelligence 1996 1194 1201
15. P. van Beek, and X. Chen CPlan a constraint programming approach to planning Proceedings of the 16th national conference on artificial intelligence 1999 585 590
16. M.B. Do, and S. Kambhampati Planning as constraint satisfaction solving the planning graph by compiling it into CSP Artificial Intelligence 132 2001 151 182
17. A. Blum, and M. Furst Fast planning through planning graph analysis Artificial Intelligence 90 1997 281 300
18. Miguel I. Dynamic flexible constraint satisfaction and its application to AI planning, Springer distinguished dissertation series, 2004.
19. H. Kautz, and B. Selman Unifying SAT-based and graph-based planning Proceedings of the 16th international joint conference on artificial intelligence 1999 318 325
20. M.W. Moskewicz, C.F. Madigan, Y. Zhao, L. Zhang, and S. Malik Chaff engineering an efficient SAT solver Proceedings of the 38th design automation conference (DAC'01) 2001
21. J. Koffman, and B. Nebel The FF planning system fast plan generation through heuristic search Journal of Artificial Intelligence Research 14 2001 253 302
22. B. Bonet, and H. Geffner Planning as heuristic search Artificial Intelligence 129 2001 5 33
23. D. Long, and M. Fox Efficient implementation of the plan graph in STAN Journal of Artificial Intelligence Research 10 1999 87 115
24. R. Fikes, and N. Nilsson Strips a new approach to the application of theorem proving to problem solving Artificial Intelligence 5 2 1971 189 208
25. I. Gent, and B. Smith Symmetry breaking in constraint programming Proceedings of the European conference on artificial intelligence 2000 599 603
26. Fahle T, Schamberger S, Sellman M. Symmetry breaking. Proceedings of the principles and practice of constraint programming, Lecture Notes in Computer Science, vol. 2239, 2001. p. 93-107.