The angel cannot move forward if he has a burned square in his path. The new version has him making two individual moves, but neither one can land him in a burned area.
I suspect that regardless of how many consecutive orthogonal move an angel can make, that the devil can eventually trap him, although it requires more pre-planning and a greater distance the angel can travel.
I do not, however, have proof of this, and I haven't yet derived a potential solution.
Originally posted by O Artem O well think of it if the Angel moves lets just say only north then how can the Demon cant him if he is behind the Angel??
"At midnight each day, the demon burns any square on the chess board, except it can't burn the square the angel is currently on"
Originally posted by brobluto I think 10 spaces for 4-direction and 40 spaces for diagonal work. They may not be the most efficient, but it get's the job done.
What are the minimum number of moves for the devil to catch a single-space-diagonal-allowed (SSDA) Angel? Assume of course that the Angel is not helping.
For that matter, what are the minimum moves where the Devil "mates" the Angel, where the Angel helps (but won't make an accidental step onto a burnt square)?