I know pursuit-evasion has been studied in many contexts, including
on a manifold (e.g., Melikyan,
"[Geometry of Pursuit-Evasion Games on Two-Dimensional Manifolds](http://www.springerlink.com/content/k50v733542102p87/)"),
but I have not seen this version:


There is a pursuer, a point $p\_t$ at time $t$, while the
evader is at $v\_t$. They start at $p\_0$ and $v\_0$.
For each $t \in \mathbb{N}$, the evader jumps from $v\_t$ to $v\_{t+1}$,
and then the pursuer jumps from $p\_t$ to $p\_{t+1}$. Both jumps
are at most a unit distance, measured by shortest path on the manifold $\cal{M}$.
Both pursuer and evader know the other's location at all times.
The evader is captured if
$p\_t = v\_t$ at some time $t$.


Let $\cal{M}$ be a sphere. Then the pursuer might fail to capture the
evader, who can just run away on a great circle.
But what if there are two pursuers, $p\_t$ and $q\_t$?
Specifically:



> 
> **Q1**.
>  For $\cal{M}$ a sphere, can an evader always be captured by two pursuers
>  initially at the north and south poles?
> 
> 
> 


There is a general principle for $\cal{M}=\mathbb{R}^n$:
it suffices for the evader to be inside the convex hull of
the pursuers (e.g.,
Kopparty, Ravishankar, "[A framework for pursuit-evasion games in $R^n$](http://www.sciencedirect.com/science/article/pii/S0020019005001638),"
*Information Proc. Lett.*, 2005).
It seems a natural extension that two antipodal pursuers on a sphere
suffice.



> 
> **Q2**.
>  For $\cal{M}$ a surface homeomorphic to a sphere embedded in $\mathbb{R^3}$,
>  with metric inherited from the
>  Euclidean metric in $\mathbb{R^3}$, will placing $p\_0$ and $q\_0$
>  at points realizing the diameter of $\cal{M}$ suffice to capture any
>  evader? (By *diameter* here I mean that the shortest path from $p\_0$
>  to $q\_0$ on the surface is maximum over all pairs of points on $\cal{M}$.)
> 
> 
> 


This is much less clear to me. A counterexample would be interesting.
But if the answer to Q2 is **Yes**,
I would be interested to learn if there are closed,
bounded surfaces of higher genus
for which just two well-placed pursuers suffice.


The literature on pursuit-evasion is vast, and I suspect the answers
to my questions are known. Thanks for suggestions or pointers!



Pursuit-Evasion on a Manifold
*My original answer was wrong, here I summarize the discussion in the comments, mostly by Barry Cipra .*


**Q1.** On the round sphere, 3 pursuers can catch the evader the following way.
If one pursuer starts from the pole then he can move staying on the same meridian,
as the evader and keeping him on a larger distance from the pole.
Moreover while doing all this the pursuer can converge to the equator.
Now let us apply the same strategy for three poles on the same distance on some equator $E$,
this will make the evader to run into one of the poles for $E$, and the pursuers will appear 
very close from three sides on angle near $\tfrac23\cdot\pi$ to each other.
The next step the game is over. 


If the equator has length $> 4$ then 2 pursuers is not enough.
The evader can allways jump in the direction with angle $\ge \tfrac\pi2$ to each of the pursuers. They can not get him, but one of them can get as close as he wants.
Moreover this can be done on any closed Riemannian manifold of arbitrary dimension.


Indeed, assume that the first pursuer always jumps by $1$ in the direction of the evader.
If the distance between evader and pursuer stays bounded below by some positive number then the trajectory has to be closer and closer to a geodesic;
say 
$$\angle v\_{n-1}v\_nv\_{n+1}\to\pi\ \ \text{as}\ \ n\to\infty.$$
If the manifold is closed 
then it is possible to predict the position of evader with great accuracy unless the distance from the first pursuer to the evader, say $d$,
gets smaller in $(1-\varepsilon)$ times for a fixed $\varepsilon>0$.


The second pursuer can appear in such places in advance and wait,
either he catches the evader or makes $d$ smaller in $(1-\varepsilon)$.


**About Q2.** Maybe an interesting question is: *Given a positive integer $n$,
is it possible to construct a Riemannian metric on the spahere so that $n$ pursuer can not catch the evader?* 


