Playing "Professor Layton and the Curious Village" on the DS. The game offers a series of puzzles strung along a threadbare mystery. Another way to stave off Alzheimer's.
Stumped on a puzzle in the game that reminds me of an old mathematical problem sprung on us sophomore kids at a special program in City College: The Seven Bridges of Konigsberg. Based on the map below, was it possible to make a journey across all seven bridges without having to cross any bridge more than once? Drunk people claim to have done so.
You can google for the answer. Only later (years) did I grasp the mathematical significance of the puzzle. Mathematicians are exempt from playing this!
No comments:
Post a Comment