Abstract
The Angel-Devil game is played on an infinite chess board. In each turn the Angel jumps from his current position to a square at distance at most k. He tries to escape his opponent, the Devil, who blocks one square in each move. It is an open question whether an Angel of some power k can escape forever. We consider Kings, who are Angels that can only walk, not jump. Introducing a general notion of speed for such modified pieces, we obtain an improvement on the current best Devil strategy. Our result, based on a recursive construction of dynamic fractal barriers, allows the Devil to encircle Kings of any speed below 2.
This work was previously published as part of the first author’s PhD thesis [9]
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Arnoux, P.: In: Berthé, V., Ferenczi, S., Mauduit, C., Siegel, A. (eds.) Substitutions in Dynamics, Arithmetics and Combinatorics, ch. 6. LNM, vol. 1794, pp. 143–198. Springer, Heidelberg (2002)
Berlekamp, E.R., Conway, H.H., Guy, R.K.: Winning Ways for your mathematical plays. Games in Particular, vol. 2. Academic Press, London (1982)
Bollobás, B., Leader, I.: The Angel and the Devil in three dimensions (manuscript)
Conway, J.H.: The angel problem. In: Nowakowski, R. (ed.) Games of No Chance. MSRI Publications, vol. 29, pp. 3–12 (1996)
Demaine, E.D.: Playing games with algorithms: Algorithmic combinatorial game theory. In: Sgall, J., Pultr, A., Kolman, P. (eds.) MFCS 2001. LNCS, vol. 2136, pp. 18–32. Springer, Heidelberg (2001)
Gale, D., Steward, F.M.: Infinite games with perfect information. In: Kuhn, H.W., Tucker, A.W. (eds.) Contributions to the Theory of Games II. Annals of Mathematics Studies, vol. 28, pp. 245–266. Princeton University Press, Princeton (1953)
Gardner, M.: Mathematical games. Scientific American 230(2), 106–108 (1974)
Jech, T.: Set Theory. Academic Press, London (1978)
Kutz, M.: The Angel Problem, Positional Games, and Digraph Roots. PhD thesis, Freie Universität Berlin (2004), http://www.diss.fu-berlin.de/2004/250/indexe.html
Martin, D.A.: Borel determinacy. Annals of Mathematics 102(2), 363–371 (1975)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kutz, M., Pór, A. (2005). Angel, Devil, and King. In: Wang, L. (eds) Computing and Combinatorics. COCOON 2005. Lecture Notes in Computer Science, vol 3595. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11533719_93
Download citation
DOI: https://doi.org/10.1007/11533719_93
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28061-3
Online ISBN: 978-3-540-31806-4
eBook Packages: Computer ScienceComputer Science (R0)