Angel Problem — a problem in game theory proposed by John Conway. The problem plays out on a infinite chessboard and tries to answer the question of how strong (how many squares the angel can move) the angel must be to defeat/escape from an ever increasing number of devils on the board.
More information
See also:
Mathworld
John Horton Conway — Wikipedia entry