Homicidal chauffeur problem
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, or the pedestrian guarantee that he can indefinitely elude the car?
Wikipage redirect
Link from a Wikipage to another Wikipage
primaryTopic
Homicidal chauffeur problem
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, or the pedestrian guarantee that he can indefinitely elude the car?
has abstract
En teoría de juegos, el proble ...... a la izquierda o giros en U.
@es
In game theory, the homicidal ...... ke left-hand turns or U-turns.
@en
В теории игр задача о водителе ...... нии (поворот на 180 градусов).
@ru
Link from a Wikipage to an external page
Wikipage page ID
15,007,740
page length (characters) of wiki page
Wikipage revision ID
978,938,950
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
subject
hypernym
type
comment
En teoría de juegos, el proble ...... o sobre juegos diferenciales.
@es
In game theory, the homicidal ...... an indefinitely elude the car?
@en
В теории игр задача о водителе ...... о книге Дифференциальные игры.
@ru
label
Homicidal chauffeur problem
@en
Juego del chofer homicida
@es
Задача о водителе-убийце
@ru