The angel of power 2 wins

被引：9
|
作者：
Mathe, Andras [1 ]
机构：
[1] Eotvos Lorand Univ, Dept Anal, H-1117 Budapest, Hungary
来源：
COMBINATORICS PROBABILITY & COMPUTING | 2007年 / 16卷 / 03期
基金：
匈牙利科学研究基金会;
关键词：
D O I：
10.1017/S0963548306008303
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We solve Conway's Angel Problem by showing that the Angel of power 2 has a winning strategy. An old observation of Conway is that we may suppose without loss of generality that the Angel never jumps to a square where he could have already landed at a previous time. We turn this observation around and prove that we may suppose without loss of generality that the Devil never eats a square where the Angel could have already jumped. Then we give a simple winning strategy for the Angel.
引用
收藏
页码：363 / 374
页数：12
相关论文
共 50 条
12345