2007/01/23 by András Máthé · 1 citation
Computer Science · Social Sciences · #Artificial Intelligence in Games #Digital Games and Media
paper · doi:10.1017/s0963548306008303
openalex publication_date 2007/01/23 · openalex created_date 2025/10/10 · openalex updated_date 2026/05/21
We solve Conway's Angel Problem by showing that the Angel of power 2 has a winning strategy. An old observation of Conway is that we may suppose without loss of generality that the Angel never jumps to a square where he could have already landed at a previous time. We turn this observation around and prove that we may suppose without loss of generality that the Devil never eats a square where the Angel could have already jumped. Then we give a simple winning strategy for the Angel.