In the category of Pursuit-evasion problems is the homicidal chauffeur problem, which puts a theoretical runner in opposition to a theoretical driver trying to race him down while they both never get tire. The slow-moving runner is very mobile while the fast driver is directly opposite. The problem is technical but straightforward; how would either one win in his respective pursuit?
Differential game
Integral game
Time-factor game
Numerical game
Constant time
Continuous time
Random time
Slow motion
Rufus Isaacs
Thomas Andrew
Peter Drury
Matt Robertson
1950
1951
1952
1953
A driver and a pedestrian
Two drivers trying to overrun each other
A driver trying to maneuver around
Two runners trying to catch a vehicle
Government policies
Academic research
Missile defence
Domestic attack
AND Corporation
RAND Corporation
OR Corporation
M-Academic Institution
Speed of the runner
Magnitude of the linear velocity
Distance between two runners
Width of the road
Maximal radius of the turn
Minimal radius of the turn
Precise radius of the turn
Rotational angle
|u| ≤ 1
U < 1
U > 1
U = 1