Homicidal chauffeur problem
id:
homicidal-chauffeur-problem-317-77009
title:
Homicidal chauffeur problem
text:
In game theory, the homicidal chauffeur problem is a mathematical pursuit problem which pits a hypothetical runner, who can only move slowly, but is highly maneuverable, against the driver of a motor vehicle, which is much faster but far less maneuverable, who is attempting to run him down. Both runner and driver are assumed to never tire. The question to be solved is: under what circumstances, and with what strategy, can the driver of the car guarantee that he can always catch the pedestrian, o
brand slug:
wiki
category slug:
encyclopedia
description:
Mathematical pursuit problem
original url:
https://en.wikipedia.org/wiki/Homicidal_chauffeur_problem
date created:
date modified:
2023-06-15T20:47:30Z
main entity:
{"identifier":"Q5890773","url":"https://www.wikidata.org/entity/Q5890773"}
image:
fields total:
13
integrity:
14