Mice problem

In mathematics, the mice problem is a continuous pursuit–evasion problem in which a number of mice (or insects, dogs, missiles, etc.)

In the classic setup, each then begins to move towards its immediate neighbour (clockwise or anticlockwise).

The goal is often to find out at what time the mice meet.

unit-length sides, the distance between neighboring mice decreases at a speed of

[1][2] For all regular polygons, each mouse traces out a pursuit curve in the shape of a logarithmic spiral.

[3] In Dara Ó Briain: School of Hard Sums, the mice problem is discussed.