06-17-2026, 01:43 AM
Summary
The Angel Problem, proposed by John Horton Conway, is a famous problem in combinatorial game theory involving an angel and a devil playing on an infinite chessboard. The angel can jump up to a fixed distance (k) each turn, while the devil permanently blocks one square per turn. The central question asks whether an angel with sufficiently large power can avoid being trapped forever.
For many years this remained unsolved, but in 2006 independent proofs showed that a power-2 angel can always escape indefinitely, meaning the angel wins against the devil when its power is at least 2. The problem is notable for its deceptively simple rules, deep strategic complexity, and connections to graph theory, algorithms, and pursuit–evasion games.
ARTICLE
The Angel Problem, proposed by John Horton Conway, is a famous problem in combinatorial game theory involving an angel and a devil playing on an infinite chessboard. The angel can jump up to a fixed distance (k) each turn, while the devil permanently blocks one square per turn. The central question asks whether an angel with sufficiently large power can avoid being trapped forever.
For many years this remained unsolved, but in 2006 independent proofs showed that a power-2 angel can always escape indefinitely, meaning the angel wins against the devil when its power is at least 2. The problem is notable for its deceptively simple rules, deep strategic complexity, and connections to graph theory, algorithms, and pursuit–evasion games.
ARTICLE
┌────────────────────────────────┐
│ KONSTANTINOS MICHAILIDIS │
└────────────────────────────────┘
│ KONSTANTINOS MICHAILIDIS │
└────────────────────────────────┘