A man and a lion are inside a disk of radius 1 with center . Both have a top speed of 1. Can the man choose a strategy to avoid being captured by the lion?

To use the Demonstration, alternate the man's move (button) and the lion's move (choose a point inside the small circle and Alt+click).

A solution consists of a polygonal line of length , with , where . The lion can run a path of the same length and can choose the strategy so that the distance converges to 0, but only as time goes to infinity.

The man's strategy is as follows. The point is constructed toward the center of the disk so that the segment is of length and perpendicular to . The square of the distance of to the center of the disk is

So the man is always inside the disk (explanation 1 for ).

The distance between the man and the lion is (explanation 2 for ).