Conway’s soldiers

E163258

Conway’s soldiers is a mathematical puzzle and thought experiment in combinatorial game theory that explores how far checkers-like pieces can advance on an infinite grid under specific movement rules.

All labels observed (4)

How this entity was disambiguated

Statements (46)

Predicate Object
instanceOf combinatorial game theory problem ⓘ
mathematical puzzle ⓘ
peg solitaire variant ⓘ
thought experiment ⓘ
appearsIn Winning Ways for your Mathematical Plays ⓘ
application example problem in combinatorial game theory textbooks ⓘ
pedagogical example in discrete mathematics courses ⓘ
boardOrientation horizontal rows numbered relative to starting line ⓘ
boardSymmetry translation-invariant in horizontal directions ⓘ
boardType infinite rectangular grid ⓘ
category Conway’s games ⓘ
constraint only finitely many moves may be played in any actual play sequence ⓘ
creatorAffiliation University of Cambridge (at time of Conway’s work in combinatorial games) ⓘ
demonstrates that local improvements can be globally bounded ⓘ
field combinatorial game theory ⓘ
recreational mathematics ⓘ
goal advance a piece as far as possible above the starting line ⓘ
hasNameOrigin named after John Horton Conway ⓘ
initialConfiguration all squares above the starting horizontal line are empty ⓘ
all squares on or below a given horizontal line are occupied ⓘ
inventor John Horton Conway ⓘ
linked to: John H. Conway
keyResult no sequence of legal moves can move a piece more than four rows above the starting line ⓘ
the fifth row above the starting line is unreachable with only orthogonal jumps ⓘ
logicalStatus mathematically solved in the standard formulation ⓘ
movementRule a move consists of jumping over an adjacent piece into an empty square and removing the jumped piece ⓘ
diagonal jumps are not allowed in the standard version ⓘ
pieces move by orthogonal jumps over adjacent pieces ⓘ
notableFeature illustrates sharp boundary between reachable and unreachable positions ⓘ
simple rules with nontrivial global constraint ⓘ
objectiveType reachability maximization ⓘ
pieceType identical checkers-like pieces ⓘ
proofMethod invariant based on weights assigned to board positions ⓘ
potential function argument ⓘ
puzzleType deterministic perfect-information puzzle ⓘ
relatedConcept checkers ⓘ
invariants in combinatorial games ⓘ
monovariants ⓘ
peg solitaire ⓘ
resultForVariant allowing diagonal moves increases the maximum reachable row ⓘ
solutionStatus exact maximum height known for standard orthogonal version ⓘ
teaches limitations of local move rules on global reachability ⓘ
use of invariants to prove impossibility results ⓘ
uses infinite checkerboard grid ⓘ
usesTool geometric series in potential function construction ⓘ
variant Conway’s soldiers on different lattices ⓘ
linked to: Conway’s soldiers

Conway’s soldiers with diagonal moves ⓘ
linked to: Conway’s soldiers

How these facts were elicited

Referenced by (4)

Full triples — surface form annotated when it differs from this entity's canonical label.

John Horton Conway → notableWork → Conway’s soldiers ⓘ
subject linked to: Horton
John H. Conway → hasConcept → Conway's soldiers ⓘ
subject linked to: John
linked to: Conway’s soldiers
Conway’s soldiers → variant → Conway’s soldiers with diagonal moves ⓘ
linked to: Conway’s soldiers
Conway’s soldiers → variant → Conway’s soldiers on different lattices ⓘ
linked to: Conway’s soldiers