Statements (24)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:board_game
|
| gptkbp:alsoKnownAs |
gptkb:angel_problem
|
| gptkbp:angelMove |
can move up to k steps in any direction
|
| gptkbp:angelPower |
k
|
| gptkbp:devilMove |
blocks one square per turn
|
| gptkbp:field |
combinatorial game theory
|
| gptkbp:firstPublished |
1982
|
| gptkbp:introduced |
gptkb:John_H._Conway
|
| gptkbp:numberOfPlayers |
two
|
| gptkbp:objectiveAngel |
survive indefinitely
|
| gptkbp:objectiveDevil |
trap the angel
|
| gptkbp:openProblem |
for which k does the angel have a winning strategy
|
| gptkbp:played_for |
infinite chessboard
|
| gptkbp:playsFor |
gptkb:Angel
gptkb:Dragon |
| gptkbp:relatedTo |
gptkb:infinite_chess
game theory |
| gptkbp:solvedBy |
gptkb:András_Máthé
gptkb:Oddvar_Kloster k ≥ 2 |
| gptkbp:solvedYear |
2006
|
| gptkbp:bfsParent |
gptkb:Conway's_angel_problem
|
| gptkbp:bfsLayer |
7
|
| https://www.w3.org/2000/01/rdf-schema#label |
angel and devil game
|