Abstract
Problems 17.3(A) and 17.3(B) come from “achievement” games invented apparently in 1976 by the famous graph theorist Frank Harary, author of over 700 papers and the well known (I enjoyed reading it in Russian translation) 1969 book Graph Theory. Frank wrote an article [Har] about these games for Geombinatorics that was “Dedicated toMartin Gardner, who gave Snaky its name.” Therefore I have a rare opportunity and distinct pleasure of giving the microphone to the inventor.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsAuthor information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2011 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Soifer, A. (2011). E17. Achievement Games: Is Snaky a Loser?. In: The Colorado Mathematical Olympiad and Further Explorations. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-75472-7_42
Download citation
DOI: https://doi.org/10.1007/978-0-387-75472-7_42
Published:
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-75471-0
Online ISBN: 978-0-387-75472-7
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)