• INTEGERS: ELECTRONIC JOURNAL O...

Result: INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 7 (2007), #G01 DIAGONAL PEG SOLITAIRE

Title:
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 7 (2007), #G01 DIAGONAL PEG SOLITAIRE
Authors:
George I. Bell
Contributors:
The Pennsylvania State University CiteSeerX Archives
Source:
http://arxiv.org/pdf/math/0606122v2.pdf.
Publication Year:
2007
Collection:
CiteSeerX
Document Type:
Academic journal text
File Description:
application/pdf
Language:
English
Relation:
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.237.2827; http://arxiv.org/pdf/math/0606122v2.pdf
Availability:
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.237.2827
http://arxiv.org/pdf/math/0606122v2.pdf
Rights:
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Accession Number:
edsbas.C9C4ABAC
Database:
BASE

Further Information

We 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. 1.