| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 436648 | Theoretical Computer Science | 2007 | 10 Pages |
Abstract
We solve the Angel Problem, by describing a strategy that guarantees the win of an Angel of power 2 or greater. Basically, the Angel should move north as quickly as possible. However, he should detour around eaten squares, as long as the extra distance does not exceed twice the number of eaten squares evaded. We show that an Angel following this strategy will always spot a trap early enough to avoid it.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
