Cat and Mouse

Has anyone ever had to do this?

--

Java applet version
M. Clancy, U.C. Berkeley
Background reading

Java for Students , chapters 8, 9, and 12.
Background

The scene is an urban park; a cat watches a mouse run around the base of a statue of the first computer. Over the course of a minute, the somewhat witless mouse moves one meter counterclockwise around the statue's base, which is circular and two meters in diameter. Every sixty seconds, the cat pursues the mouse as follows:

ect. ect.

>>1

no, not really

I had to approximately topologically sort a directed graph though, which I did by recursively finding strongly connected components with Tarjan's algorithm modified to return them in a reverse postorder. Pretty easy if you ask me.