Conway's Angel in three dimensions

Kutz, Martin

アイテム詳細

登録内容を編集ファイル形式で保存

一時保存へ追加

タグ情報を表示リリース履歴を表示詳細要約

公開

学術論文

Conway's Angel in three dimensions

MPS-Authors

/persons/resource/persons44874

Kutz, Martin
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

There are no locators available

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

フルテキスト (公開)

公開されているフルテキストはありません

付随資料 (公開)

There is no public supplementary material available

引用

Kutz, M. (2005). Conway's Angel in three dimensions. Theoretical Computer Science, 349, 443-451.

引用: https://hdl.handle.net/11858/00-001M-0000-000F-2624-C

要旨

The Angel-Devil game is an infinite game played on an infinite chess board: In each move the Angel, a generalized chess king, jumps from his current square to some location at distance at most $k$, while his opponent, the Devil, blocks squares trying to strand the Angel. The Angel wins if he manages to fly on forever. It is a long-standing open question whether some Angel of sufficiently large power $k$ can escape. We show that in the three-dimensional analog of the game the 13-Angel can win. Our proof is constructive and provides an explicit infinite escape strategy.