Solution to a problem of guarding territory (Q1073723)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Solution to a problem of guarding territory |
scientific article; zbMATH DE number 3945923
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solution to a problem of guarding territory |
scientific article; zbMATH DE number 3945923 |
Statements
Solution to a problem of guarding territory (English)
0 references
1986
0 references
There are two players on the plane: an invader I with maximal speed \(v>1\) and a defender D with maximal speed 1. It is shown that the disk of radius \(rv(v-1)^{-1}\) (where r denotes the ''destruction radius'' of the defender) is the domain of largest area which can be guarded by the defender.
0 references
problem of guarding territory
0 references
strategies
0 references
planar two-person game
0 references
invader
0 references
defender
0 references
