Article contents
The Angel of Power 2 Wins
Published online by Cambridge University Press: 01 May 2007
Abstract
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.
- Type
- Paper
- Information
- Copyright
- Copyright © Cambridge University Press 2007
References
[1]Bollobás, B. and Leader, I. (2006) The Angel and the Devil in three dimensions. J. Combin. Theory Ser. A 113 176–184.CrossRefGoogle Scholar
[2]Bowditch, B. H. (2007) The angel game in the plane. Combin. Probab. Comput. 16 345–362.CrossRefGoogle Scholar
[3]Conway, J. H. (1996) The Angel problem. In Games of No Chance (Nowakowski, R. J., ed.), Cambridge University Press, pp. 3–12.Google Scholar
[6]Kutz, M. (2005) Conway's Angel in three dimensions. Theoret. Comput. Sci. 349 443–451.CrossRefGoogle Scholar
[7]Kutz, M. and Pór, A. (2005) Angel, Devil, and King. In Computing and Combinatorics, Vol. 3595 of Lecture Notes in Computer Science, Springer, Berlin, pp. 925–934.Google Scholar
- 8
- Cited by