Treffer: INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 7 (2007), #G07 THE MINIMUM SIZE REQUIRED OF A SOLITAIRE ARMY

Title:
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 7 (2007), #G07 THE MINIMUM SIZE REQUIRED OF A SOLITAIRE ARMY
Authors:
George I. Bell, Daniel S. Hirschberg, Pablo Guerrero-garcía
Contributors:
The Pennsylvania State University CiteSeerX Archives
Source:
http://arxiv.org/pdf/math/0612612v2.pdf.
Publication Year:
2007
Collection:
CiteSeerX
Document Type:
Fachzeitschrift text
File Description:
application/pdf
Language:
English
Relation:
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.240.2117; http://arxiv.org/pdf/math/0612612v2.pdf
Availability:
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.240.2117
http://arxiv.org/pdf/math/0612612v2.pdf
Rights:
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Accession Number:
edsbas.359ACDD6
Database:
BASE

Weitere Informationen

The solitaire army is a one-person peg jumping game where a player attempts to advance an “army ” of pegs as far as possible into empty territory. The game was introduced by John Conway and is also known as “Conway’s Soldiers”. We consider various generalizations of this game in different 2D geometries, unify them under a common mathematical framework, and find the minimum size army capable of advancing a given number of steps. 1.