Angel, Devil, and King

6Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

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. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Kutz, M., & Pór, A. (2005). Angel, Devil, and King. In Lecture Notes in Computer Science (Vol. 3595, pp. 925–934). Springer Verlag. https://doi.org/10.1007/11533719_93

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free