even though i predict this thread to fail because of lack of interest, i will post it anyways
imagine an infinite chess board. on this board there is a chess piece- Angel, which can move in any direction, in distance of maximally
n squares per one turn
the second player is Devil, which can remove any chessboard square per turn, creating a hole, so angel won't be able to step on it. angel is able to leap over holes but can not stand on them
*
devil wins if he traps angel inside of an island surrounded by a hole of length
n, so angel can't leap over the hole and escape from this island.
*
angel wins if he's able to move infinitely without getting trapped
questions are:
can angel win? can devil win?
can angel always win?
can angel win if his [n] power is high enough?
can devil trap angel of any finite power? (be aware that this is an infinite chess board and the board pieces destroyed by devil may be light years far away)
discuss! (try thinking before using google
)