Drunk Angel and Hiding Devil
Nuttanon Songsuwan, Anuwat Tangthanawatsakul, Pawaton Kaemawichanurat

TL;DR
This paper investigates a probabilistic variant of the angel and devil game on infinite grids, demonstrating that the devil can effectively cage a drunk angel in one or two dimensions with high probability, and analyzing related hitting times.
Contribution
It introduces a new probabilistic version of the angel and devil game, providing strategies for the devil and analyzing the game in higher dimensions with numerical simulations.
Findings
Devil can cage a drunk angel with high probability in 1D and 2D.
Strategies depend on the dimension of the grid.
Analysis of hitting times for the angel outside a sphere.
Abstract
The angel game is played on -dimensional infinite grid by players, the angel and the devil. In each turn, the angel of power moves from her current point to a point which while the devil chooses a point to destroy in his turn. Then, the angel can no longer land on these destroyed points. The angel wins if she has a strategy to escape from the devil forever and the devil wins if he can cage the angel in his destroyed points by a finite number of turns. It was proved in 2007 that the angel of power at least always wins. In this paper, we rise the problem when the angel is drunk. She randomly moves to any point in the range of her power in each turn. In our game version, the devil must cage the angel by a given finite number of turns, otherwise, the angel wins. We present a strategy for the devil that: if…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsArtificial Intelligence in Games · Computability, Logic, AI Algorithms · Guidance and Control Systems
