Chases and Escapes: The Mathematics of Pursuit and Evasion
AuthorPaul J. Nahin
LanguageEnglish
SubjectContinuous pursuit–evasion problems
PublisherPrinceton University Press
Publication date
2007
ISBN978-0-691-12514-5

Chases and Escapes: The Mathematics of Pursuit and Evasion is a mathematics book on continuous pursuit–evasion problems. It was written by Paul J. Nahin, and published by the Princeton University Press in 2007. It was reissued as a paperback reprint in 2012.[1] The Basic Library List Committee of the Mathematical Association of America has rated this book as essential for inclusion in undergraduate mathematics libraries.[2]

Topics

The book has four chapters,[2] covering the solutions to 21 continuous pursuit–evasion problems,[3] with an additional 10 "challenge problems" left for readers to solve, with solutions given in an appendix.[3][4] The problems are presented as entertaining stories[5] that "breathe life into the mathematics and invite wider engagement",[6] and their solutions use varied methods,[5] including the computer calculation of numerical solutions for differential equations whose solutions have no closed form.[2] Most of the material was previously known, but is collected here for the first time.[7] The book also provides background material on the history of the problems it describes, although this is not its main focus.[6]

Even before beginning its main content, the preface of the book begins with an example of pure evasion from known pursuit, the path used by the Enola Gay to escape the blast of the nuclear bomb it dropped on Hiroshima.[4] The first chapter of the book concerns the opposite situation of "pure pursuit" without evasion, including the initial work in this area by Pierre Bouguer in 1732. Bouger studied a problem of pirates chasing a merchant ship, in which the merchant ship (unaware of the pirates) travels on a straight line while the pirate ship always travels towards the current position of the merchant ship. The resulting pursuit curve is called a radiodrome, and this chapter studies several similar problems and stories involving a linearly moving target,[8][9] including variations where the pursuer may aim ahead of the target and the tractrix curve generated by a pursuer that follows the target at constant distance.[7]

Chapter 2 considers targets moving to evade their pursuers, beginning with an example of circular evasive motion described in terms of a dog chasing a duck in a pond, with the dog beginning at the center and the duck moving circularly around the bank.[8] Other variants considered in this chapter include cases where the target is hidden from view, and moving on an unknown trajectory.[7] Chapter 3 considers "cyclic pursuit" problems in which multiple agents pursue each other, as in the mice problem.[8][7]

The fourth and final chapter is entitled "Seven classic evasion problems". It begins with a problem from Martin Gardner's Mathematical Games, the reverse of the dog-and-duck problem, in which a person on a raft in a circular lake tries to reach the shore before a pursuer on land reaches the same point.[8][7] It also includes hide-and-seek problems and their formulation using game theory, and the work of Richard Rado and Abram Samoilovitch Besicovitch on a man and lion of equal speed trapped in a circular arena, with the lion trying to catch the man,[8] first popularized in A Mathematician's Miscellany by J. E. Littlewood.[7]

Audience and reception

The book assumes an undergraduate-level understanding of calculus and differential equations.[8][4][6] It also uses some game theory but its coverage of the necessary material in this area is self-contained.[8] It is not a textbook, but could be used to provide motivating examples for courses in calculus and differential equations,[2][4] or as the basis of an undergraduate research project to a student who has completed this material.[3][4] As well, the book may be of interest to any reader with the requisite background who enjoys mathematics.[5][7]

Game theorist Gerald A. Heuer writes that "The treatment in general is very good, and readers are likely to appreciate the author's friendly and lively writing style."[8] On the other hand, Mark Colyvan, a philosopher, would have preferred to see heavier coverage of the game-theoretic aspects of the subject, and notes that the mathematical idealizations used here can lead to inaccurate conclusions for real-world problems. Despite these quibbles, Colyvan writes that "this book provides an excellent vehicle to pursue the mathematics in question, and the mathematics in question is most certainly worth pursuing".[6] Reviewer Bill Satzer calls the book "highly readable",[2] and reviewer Justin Mullins writes that author Paul Nahin "guides us masterfully through the maths".[10]

References

  1. ↑ Zbl 1154.91006
  2. 1 2 3 4 5 Satzer, William J. (June 2007), "Review of Chases and Escapes", MAA Reviews, Mathematical Association of America
  3. 1 2 3 Sonnabend, Thomas (March 2008), "Review of Chases and Escapes", The Mathematics Teacher, 101 (7): 558, JSTOR 20876207
  4. 1 2 3 4 5 Puharic, Douglas (December 2013 – January 2014), "Review of Chases and Escapes", The Mathematics Teacher, 107 (5): 395, doi:10.5951/mathteacher.107.5.0394, JSTOR 10.5951/mathteacher.107.5.0394
  5. 1 2 3 Mahanti, Prabhat Kumar, "Review of Chases and Escapes", zbMATH, Zbl 1154.91006
  6. 1 2 3 4 Colyvan, Mark (December 2007), "The calculus of cat and mouse (review of Chases and Escapes)", Australian Review of Public Affairs, archived from the original on 2020-01-07, retrieved 2020-02-22
  7. 1 2 3 4 5 6 7 Tabachnikov, Serge (March 2009), "Review of Chases and Escapes", The Mathematical Intelligencer, 31 (2): 78–79, doi:10.1007/s00283-009-9036-z
  8. 1 2 3 4 5 6 7 8 Heuer, G. A. (2008), "Review of Chases and Escapes", Mathematical Reviews, MR 2319182
  9. ↑ Dartnell, Lewis (December 1, 2007), "Review of Chases and Escapes", Plus Magazine
  10. ↑ Mullins, Justin (June 27, 2007), "The hunter and the hunted (review of Chases and Escapes)", New Scientist
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.