Statements (19)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:board_game
|
| gptkbp:category |
combinatorial game theory
|
| gptkbp:hasNoChanceElement |
true
|
| gptkbp:hasNoHiddenInformation |
true
|
| https://www.w3.org/2000/01/rdf-schema#label |
Brussels Sprouts (game)
|
| gptkbp:introducedIn |
1967
|
| gptkbp:inventedBy |
gptkb:John_H._Conway
gptkb:Michael_S._Paterson |
| gptkbp:maximumMoves |
5n-2 for n starting crosses
|
| gptkbp:moveDescription |
connect two free ends with a line, then add a short stroke across the new line
|
| gptkbp:numberOfPlayers |
2
|
| gptkbp:objective |
be the last player able to make a move
|
| gptkbp:publishedIn |
gptkb:Mathematical_Gazette
|
| gptkbp:relatedTo |
gptkb:Sprouts_(game)
|
| gptkbp:startingConfiguration |
n crosses, each with 4 free ends
|
| gptkbp:type |
pencil-and-paper game
topological game |
| gptkbp:bfsParent |
gptkb:Sprouts_(game)
|
| gptkbp:bfsLayer |
6
|