Integer programming based algorithms for peg solitaire problems

DOI10.1007/3-540-45579-5_15MaRDI QIDQ4536691zbMATH OpenFDO

Authors Masashi Kiyomi, Tomomi Matsui

Publication date 6 August 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-45579-5_15

zbMATH Keywords

backtrack searchinginteger programmingpeg solitaire

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Integer programming (90C10) Experimental studies (91A90)

Recommendations

• Modelling and solving English peg solitaire
• Large peg-army maneuvers
• Solving triangular peg solitaire
• Diagonal peg solitaire
• A fresh look at peg solitaire

Cited in

(1)

• Modelling and solving English peg solitaire

This page was built for publication: Integer programming based algorithms for peg solitaire problems

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