To main content

A solution to the Angel Problem

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.

Category

Academic article

Language

English

Author(s)

Affiliation

  • SINTEF Digital / Mathematics and Cybernetics

Year

2007

Published in

Theoretical Computer Science

ISSN

0304-3975

Publisher

Elsevier

Volume

389

Issue

1-2

Page(s)

152 - 161

View this publication at Cristin