|
gptkbp:instanceOf
|
gptkb:board_game
|
|
gptkbp:cannotReach
|
row 5 or higher
|
|
gptkbp:describedBy
|
gptkb:Winning_Ways_for_your_Mathematical_Plays
|
|
gptkbp:field
|
gptkb:mathematics
combinatorial game theory
|
|
gptkbp:firstPublished
|
1961
|
|
gptkbp:generalizes
|
gptkb:Conway's_angel_problem
higher-dimensional versions
|
|
gptkbp:hasProofType
|
invariant method
|
|
gptkbp:hasRule
|
soldiers can only move by jumping over adjacent soldiers into empty squares
soldiers can only move upwards (north) on the board
players move pegs (soldiers) on an infinite checkerboard
|
|
gptkbp:hasVariant
|
diagonal moves allowed
higher-dimensional boards
|
|
https://www.w3.org/2000/01/rdf-schema#label
|
Conway's soldiers
|
|
gptkbp:inventedBy
|
gptkb:John_Horton_Conway
|
|
gptkbp:maximumReachableRow
|
row 4
|
|
gptkbp:notableFor
|
demonstrating limits of infinite processes in games
|
|
gptkbp:objective
|
move a soldier as far north as possible
|
|
gptkbp:relatedTo
|
gptkb:mathematics
gptkb:peg_solitaire
|
|
gptkbp:bfsParent
|
gptkb:John_H._Conway
gptkb:John_Horton_Conway
gptkb:John_Conway
|
|
gptkbp:bfsLayer
|
5
|