Diagonal Peg Solitaire

Simple item page
dc.creatorBell, George I.
dc.date2006-06-06
dc.date2007-01-25
dc.date.accessioned2026-07-07T07:45:18Z
dc.date.available2026-07-07T07:45:18Z
dc.descriptionWe study the classical game of peg solitaire when diagonal jumps are allowed. We prove that on many boards, one can begin from a full board with one peg missing, and finish with one peg anywhere on the board. We then consider the problem of finding solutions that minimize the number of moves (where a move is one or more jumps by the same peg), and find the shortest solution to the "central game", which begins and ends at the center. In some cases we can prove analytically that our solutions are the shortest possible, in other cases we apply A* or bidirectional search heuristics.
dc.description20 pages, 11 figures
dc.identifierhttps://arxiv.org/abs/math/0606122
dc.identifierhttp://arxiv.org/abs/math/0606122
dc.identifierINTEGERS: Electronic Journal of Combinatorial Number Theory 7 (2007) #G01
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/123486
dc.subjectCombinatorics
dc.subjectDiscrete Mathematics
dc.subjectData Structures and Algorithms
dc.subject00A08; 97A20
dc.titleDiagonal Peg Solitaire
dc.typetext

Files

Collections

arXiv