What Do You Know About The Homicidal Chauffeur Problem?
Settings
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?
- 1.Which category does the game belong to?
- A.
Differential game
- B.
Integral game
- C.
Time-factor game
- D.
Numerical game
- 2.In which time range is the game played?
- A.
Constant time
- B.
Continuous time
- C.
Random time
- D.
Slow motion
- 3.Who proposed the puzzle?
- A.
Rufus Isaacs
- B.
Thomas Andrew
- C.
Peter Drury
- D.
Matt Robertson
- 4.Which year was the puzzle proposed?
- A.
1950
- B.
1951
- C.
1952
- D.
1953
- 5.The game involves which sets of people?
- A.
A driver and a pedestrian
- B.
Two drivers trying to overrun each other
- C.
A driver trying to maneuver around
- D.
Two runners trying to catch a vehicle
- 6.Which unclassified proxy is the puzzle used for?
- A.
Government policies
- B.
Academic research
- C.
Missile defence
- D.
Domestic attack
- 7.Which corporation was the puzzle first developed for?
- A.
AND Corporation
- B.
RAND Corporation
- C.
OR Corporation
- D.
M-Academic Institution
- 8.What does "w" represent in the puzzle?
- A.
Speed of the runner
- B.
Magnitude of the linear velocity
- C.
Distance between two runners
- D.
Width of the road
- 9.What does "R" represent in the puzzle?
- A.
Maximal radius of the turn
- B.
Minimal radius of the turn
- C.
Precise radius of the turn
- D.
Rotational angle
- 10.How do you think "u" should be represented?
- A.
|u| ≤ 1
- B.
U < 1
- C.
U > 1
- D.
U = 1
Back to top