Chases and Escapes : : The Mathematics of Pursuit and Evasion / / Paul J. Nahin.

We all played tag when we were kids. What most of us don't realize is that this simple chase game is in fact an application of pursuit theory, and that the same principles of games like tag, dodgeball, and hide-and-seek are also at play in military strategy, high-seas chases by the Coast Guard,...

Full description

Saved in:
Bibliographic Details
VerfasserIn:
Place / Publishing House:Princeton, NJ : : Princeton University Press, , [2012]
©2012
Year of Publication:2012
Edition:With a New preface by the author
Language:English
Series:Princeton Puzzlers
Online Access:
Physical Description:1 online resource (272 p.) :; 5 halftones. 67 line illus.
Tags: Add Tag
No Tags, Be the first to tag this record!
id 9781400842063
ctrlnum (DE-B1597)447353
(OCoLC)979968573
collection bib_alma
record_format marc
spelling Nahin, Paul J., author. aut http://id.loc.gov/vocabulary/relators/aut
Chases and Escapes : The Mathematics of Pursuit and Evasion / Paul J. Nahin.
With a New preface by the author
Princeton, NJ : Princeton University Press, [2012]
©2012
1 online resource (272 p.) : 5 halftones. 67 line illus.
text txt rdacontent
computer c rdamedia
online resource cr rdacarrier
text file PDF rda
Princeton Puzzlers
Frontmatter -- Contents -- Preface to the Paperback Edition -- What You Need to Know to Read This Book (and How I Learned What I Needed to Know to Write It) -- Introduction -- Chapter 1. The Classic Pursuit Problem -- Chapter 2. Pursuit of (Mostly) Maneuvering Targets -- Chapter 3. Cyclic Pursuit -- Chapter 4. Seven Classic Evasion Problems -- Appendix A. Solution to the Challenge Problems of Section 1.1 -- Appendix B. Solutions to the Challenge Problems of Section 1.2 -- Appendix C. Solution to the Challenge Problem of Section 1.5 -- Appendix D. Solution to the Challenge Problem of Section 2.2 -- Appendix E. Solution to the Challenge Problem of Section 2.3 -- Appendix F. Solution to the Challenge Problem of Section 2.5 -- Appendix G. Solution to the Challenge Problem of Section 3.2 -- Appendix H. Solution to the Challenge Problem of Section 4.3 -- Appendix I. Solution to the Challenge Problem of Section 4.4 -- Appendix J. Solution to the Challenge Problem of Section 4.7 -- Appendix K. Guelman's Proof -- Notes -- Bibliography -- Acknowledgments -- Index -- Backmatter
restricted access http://purl.org/coar/access_right/c_16ec online access with authorization star
We all played tag when we were kids. What most of us don't realize is that this simple chase game is in fact an application of pursuit theory, and that the same principles of games like tag, dodgeball, and hide-and-seek are also at play in military strategy, high-seas chases by the Coast Guard, and even romantic pursuits. In Chases and Escapes, Paul Nahin gives us the first complete history of this fascinating area of mathematics, from its classical analytical beginnings to the present day. Drawing on game theory, geometry, linear algebra, target-tracking algorithms, and much more, Nahin also offers an array of challenging puzzles with their historical background and broader applications. Chases and Escapes includes solutions to all problems and provides computer programs that readers can use for their own cutting-edge analysis. Now with a gripping new preface on how the Enola Gay escaped the shock wave from the atomic bomb dropped on Hiroshima, this book will appeal to anyone interested in the mathematics that underlie pursuit and evasion.Some images inside the book are unavailable due to digital copyright restrictions.
Issued also in print.
Mode of access: Internet via World Wide Web.
In English.
Description based on online resource; title from PDF title page (publisher's Web site, viewed 30. Aug 2021)
Differential games.
MATHEMATICS / Recreations & Games. bisacsh
print 9780691155012
https://doi.org/10.1515/9781400842063
https://www.degruyter.com/isbn/9781400842063
Cover https://www.degruyter.com/cover/covers/9781400842063.jpg
language English
format eBook
author Nahin, Paul J.,
Nahin, Paul J.,
spellingShingle Nahin, Paul J.,
Nahin, Paul J.,
Chases and Escapes : The Mathematics of Pursuit and Evasion /
Princeton Puzzlers
Frontmatter --
Contents --
Preface to the Paperback Edition --
What You Need to Know to Read This Book (and How I Learned What I Needed to Know to Write It) --
Introduction --
Chapter 1. The Classic Pursuit Problem --
Chapter 2. Pursuit of (Mostly) Maneuvering Targets --
Chapter 3. Cyclic Pursuit --
Chapter 4. Seven Classic Evasion Problems --
Appendix A. Solution to the Challenge Problems of Section 1.1 --
Appendix B. Solutions to the Challenge Problems of Section 1.2 --
Appendix C. Solution to the Challenge Problem of Section 1.5 --
Appendix D. Solution to the Challenge Problem of Section 2.2 --
Appendix E. Solution to the Challenge Problem of Section 2.3 --
Appendix F. Solution to the Challenge Problem of Section 2.5 --
Appendix G. Solution to the Challenge Problem of Section 3.2 --
Appendix H. Solution to the Challenge Problem of Section 4.3 --
Appendix I. Solution to the Challenge Problem of Section 4.4 --
Appendix J. Solution to the Challenge Problem of Section 4.7 --
Appendix K. Guelman's Proof --
Notes --
Bibliography --
Acknowledgments --
Index --
Backmatter
author_facet Nahin, Paul J.,
Nahin, Paul J.,
author_variant p j n pj pjn
p j n pj pjn
author_role VerfasserIn
VerfasserIn
author_sort Nahin, Paul J.,
title Chases and Escapes : The Mathematics of Pursuit and Evasion /
title_sub The Mathematics of Pursuit and Evasion /
title_full Chases and Escapes : The Mathematics of Pursuit and Evasion / Paul J. Nahin.
title_fullStr Chases and Escapes : The Mathematics of Pursuit and Evasion / Paul J. Nahin.
title_full_unstemmed Chases and Escapes : The Mathematics of Pursuit and Evasion / Paul J. Nahin.
title_auth Chases and Escapes : The Mathematics of Pursuit and Evasion /
title_alt Frontmatter --
Contents --
Preface to the Paperback Edition --
What You Need to Know to Read This Book (and How I Learned What I Needed to Know to Write It) --
Introduction --
Chapter 1. The Classic Pursuit Problem --
Chapter 2. Pursuit of (Mostly) Maneuvering Targets --
Chapter 3. Cyclic Pursuit --
Chapter 4. Seven Classic Evasion Problems --
Appendix A. Solution to the Challenge Problems of Section 1.1 --
Appendix B. Solutions to the Challenge Problems of Section 1.2 --
Appendix C. Solution to the Challenge Problem of Section 1.5 --
Appendix D. Solution to the Challenge Problem of Section 2.2 --
Appendix E. Solution to the Challenge Problem of Section 2.3 --
Appendix F. Solution to the Challenge Problem of Section 2.5 --
Appendix G. Solution to the Challenge Problem of Section 3.2 --
Appendix H. Solution to the Challenge Problem of Section 4.3 --
Appendix I. Solution to the Challenge Problem of Section 4.4 --
Appendix J. Solution to the Challenge Problem of Section 4.7 --
Appendix K. Guelman's Proof --
Notes --
Bibliography --
Acknowledgments --
Index --
Backmatter
title_new Chases and Escapes :
title_sort chases and escapes : the mathematics of pursuit and evasion /
series Princeton Puzzlers
series2 Princeton Puzzlers
publisher Princeton University Press,
publishDate 2012
physical 1 online resource (272 p.) : 5 halftones. 67 line illus.
Issued also in print.
edition With a New preface by the author
contents Frontmatter --
Contents --
Preface to the Paperback Edition --
What You Need to Know to Read This Book (and How I Learned What I Needed to Know to Write It) --
Introduction --
Chapter 1. The Classic Pursuit Problem --
Chapter 2. Pursuit of (Mostly) Maneuvering Targets --
Chapter 3. Cyclic Pursuit --
Chapter 4. Seven Classic Evasion Problems --
Appendix A. Solution to the Challenge Problems of Section 1.1 --
Appendix B. Solutions to the Challenge Problems of Section 1.2 --
Appendix C. Solution to the Challenge Problem of Section 1.5 --
Appendix D. Solution to the Challenge Problem of Section 2.2 --
Appendix E. Solution to the Challenge Problem of Section 2.3 --
Appendix F. Solution to the Challenge Problem of Section 2.5 --
Appendix G. Solution to the Challenge Problem of Section 3.2 --
Appendix H. Solution to the Challenge Problem of Section 4.3 --
Appendix I. Solution to the Challenge Problem of Section 4.4 --
Appendix J. Solution to the Challenge Problem of Section 4.7 --
Appendix K. Guelman's Proof --
Notes --
Bibliography --
Acknowledgments --
Index --
Backmatter
isbn 9781400842063
9780691155012
callnumber-first Q - Science
callnumber-subject QA - Mathematics
callnumber-label QA272
callnumber-sort QA 3272 N34 42012EB
url https://doi.org/10.1515/9781400842063
https://www.degruyter.com/isbn/9781400842063
https://www.degruyter.com/cover/covers/9781400842063.jpg
illustrated Illustrated
dewey-hundreds 500 - Science
dewey-tens 510 - Mathematics
dewey-ones 519 - Probabilities & applied mathematics
dewey-full 519.3/2
dewey-sort 3519.3 12
dewey-raw 519.3/2
dewey-search 519.3/2
doi_str_mv 10.1515/9781400842063
oclc_num 979968573
work_keys_str_mv AT nahinpaulj chasesandescapesthemathematicsofpursuitandevasion
status_str n
ids_txt_mv (DE-B1597)447353
(OCoLC)979968573
carrierType_str_mv cr
is_hierarchy_title Chases and Escapes : The Mathematics of Pursuit and Evasion /
_version_ 1770176667702001664
fullrecord <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>04560nam a22006855i 4500</leader><controlfield tag="001">9781400842063</controlfield><controlfield tag="003">DE-B1597</controlfield><controlfield tag="005">20210830012106.0</controlfield><controlfield tag="006">m|||||o||d||||||||</controlfield><controlfield tag="007">cr || ||||||||</controlfield><controlfield tag="008">210830t20122012nju fo d z eng d</controlfield><datafield tag="019" ind1=" " ind2=" "><subfield code="a">(OCoLC)1054880563</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781400842063</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1515/9781400842063</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-B1597)447353</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)979968573</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-B1597</subfield><subfield code="b">eng</subfield><subfield code="c">DE-B1597</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">nju</subfield><subfield code="c">US-NJ</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">QA272</subfield><subfield code="b">.N34 2012eb</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">MAT025000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">519.3/2</subfield><subfield code="2">22</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Nahin, Paul J., </subfield><subfield code="e">author.</subfield><subfield code="4">aut</subfield><subfield code="4">http://id.loc.gov/vocabulary/relators/aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Chases and Escapes :</subfield><subfield code="b">The Mathematics of Pursuit and Evasion /</subfield><subfield code="c">Paul J. Nahin.</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">With a New preface by the author</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Princeton, NJ : </subfield><subfield code="b">Princeton University Press, </subfield><subfield code="c">[2012]</subfield></datafield><datafield tag="264" ind1=" " ind2="4"><subfield code="c">©2012</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (272 p.) :</subfield><subfield code="b">5 halftones. 67 line illus.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">computer</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">online resource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="347" ind1=" " ind2=" "><subfield code="a">text file</subfield><subfield code="b">PDF</subfield><subfield code="2">rda</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Princeton Puzzlers</subfield></datafield><datafield tag="505" ind1="0" ind2="0"><subfield code="t">Frontmatter -- </subfield><subfield code="t">Contents -- </subfield><subfield code="t">Preface to the Paperback Edition -- </subfield><subfield code="t">What You Need to Know to Read This Book (and How I Learned What I Needed to Know to Write It) -- </subfield><subfield code="t">Introduction -- </subfield><subfield code="t">Chapter 1. The Classic Pursuit Problem -- </subfield><subfield code="t">Chapter 2. Pursuit of (Mostly) Maneuvering Targets -- </subfield><subfield code="t">Chapter 3. Cyclic Pursuit -- </subfield><subfield code="t">Chapter 4. Seven Classic Evasion Problems -- </subfield><subfield code="t">Appendix A. Solution to the Challenge Problems of Section 1.1 -- </subfield><subfield code="t">Appendix B. Solutions to the Challenge Problems of Section 1.2 -- </subfield><subfield code="t">Appendix C. Solution to the Challenge Problem of Section 1.5 -- </subfield><subfield code="t">Appendix D. Solution to the Challenge Problem of Section 2.2 -- </subfield><subfield code="t">Appendix E. Solution to the Challenge Problem of Section 2.3 -- </subfield><subfield code="t">Appendix F. Solution to the Challenge Problem of Section 2.5 -- </subfield><subfield code="t">Appendix G. Solution to the Challenge Problem of Section 3.2 -- </subfield><subfield code="t">Appendix H. Solution to the Challenge Problem of Section 4.3 -- </subfield><subfield code="t">Appendix I. Solution to the Challenge Problem of Section 4.4 -- </subfield><subfield code="t">Appendix J. Solution to the Challenge Problem of Section 4.7 -- </subfield><subfield code="t">Appendix K. Guelman's Proof -- </subfield><subfield code="t">Notes -- </subfield><subfield code="t">Bibliography -- </subfield><subfield code="t">Acknowledgments -- </subfield><subfield code="t">Index -- </subfield><subfield code="t">Backmatter</subfield></datafield><datafield tag="506" ind1="0" ind2=" "><subfield code="a">restricted access</subfield><subfield code="u">http://purl.org/coar/access_right/c_16ec</subfield><subfield code="f">online access with authorization</subfield><subfield code="2">star</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">We all played tag when we were kids. What most of us don't realize is that this simple chase game is in fact an application of pursuit theory, and that the same principles of games like tag, dodgeball, and hide-and-seek are also at play in military strategy, high-seas chases by the Coast Guard, and even romantic pursuits. In Chases and Escapes, Paul Nahin gives us the first complete history of this fascinating area of mathematics, from its classical analytical beginnings to the present day. Drawing on game theory, geometry, linear algebra, target-tracking algorithms, and much more, Nahin also offers an array of challenging puzzles with their historical background and broader applications. Chases and Escapes includes solutions to all problems and provides computer programs that readers can use for their own cutting-edge analysis. Now with a gripping new preface on how the Enola Gay escaped the shock wave from the atomic bomb dropped on Hiroshima, this book will appeal to anyone interested in the mathematics that underlie pursuit and evasion.Some images inside the book are unavailable due to digital copyright restrictions.</subfield></datafield><datafield tag="530" ind1=" " ind2=" "><subfield code="a">Issued also in print.</subfield></datafield><datafield tag="538" ind1=" " ind2=" "><subfield code="a">Mode of access: Internet via World Wide Web.</subfield></datafield><datafield tag="546" ind1=" " ind2=" "><subfield code="a">In English.</subfield></datafield><datafield tag="588" ind1="0" ind2=" "><subfield code="a">Description based on online resource; title from PDF title page (publisher's Web site, viewed 30. Aug 2021)</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Differential games.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">MATHEMATICS / Recreations &amp; Games.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="776" ind1="0" ind2=" "><subfield code="c">print</subfield><subfield code="z">9780691155012</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1515/9781400842063</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://www.degruyter.com/isbn/9781400842063</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="3">Cover</subfield><subfield code="u">https://www.degruyter.com/cover/covers/9781400842063.jpg</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_BACKALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_CL_MTPY</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_EBACKALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_EBKALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_ECL_MTPY</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_EEBKALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_ESTMALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_PPALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_STMALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV-deGruyter-alles</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">PDA12STME</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">PDA13ENGE</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">PDA18STMEE</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">PDA5EBK</subfield></datafield></record></collection>