Can you solve the virus riddle? - Lisa Winer
- 11,953,641 Views
- 8,159 Questions Answered
- TEDEd Animation
Let’s Begin…
Your research team has found a prehistoric virus
preserved in the permafrost and isolated it for study. After a late
night working, you’re just closing up the lab when a sudden earthquake
hits and breaks all the sample vials. Will you be able to destroy the virus before the vents open and unleash a deadly airborne plague? Lisa Winer shows how.
Create and share a new lesson based on this one.
Additional Resources for you to Explore
Another famous problem involving chessboards is the Knight’s Tour, in which a knight (the horse-shaped chess piece) must visit every square on an empty chessboard exactly once, using only knight moves. Computer programming classes often have students create a program to find a knights tour. The path is “closed” if at the end of the knight’s tour, the knight is exactly one knight’s move away from where it started. This is also known as a Hamiltonian Cycle, as opposed to the Hamiltonian Path we heard about in the Virus Riddle.
A very famous problem that involves weighted Hamiltonian Cycles is known as The Traveling Salesman problem (TSP). In this problem, a salesman starts from home and visits every city on his route exactly once and returns home, and does so in the shortest possible (or cheapest) way (thus the graph is weighted with distance.) This is a problem involving optimization and is an example of how mathematics can be used in operations research.
The Icosian Game was a wooden dodecahedron puzzle where each peg was a city and the object was to find a Hamiltonian Cycle. It was invented in 1857 by Irish mathematician Sir William Rowan Hamilton. Try the game here.
Another fun Hamiltonian Path Puzzle from the New York Times can be found here. Love the challenge of solving riddles? TED Ed has more! Click here and find one that looks interesting and give it a try.
A very famous problem that involves weighted Hamiltonian Cycles is known as The Traveling Salesman problem (TSP). In this problem, a salesman starts from home and visits every city on his route exactly once and returns home, and does so in the shortest possible (or cheapest) way (thus the graph is weighted with distance.) This is a problem involving optimization and is an example of how mathematics can be used in operations research.
The Icosian Game was a wooden dodecahedron puzzle where each peg was a city and the object was to find a Hamiltonian Cycle. It was invented in 1857 by Irish mathematician Sir William Rowan Hamilton. Try the game here.
Another fun Hamiltonian Path Puzzle from the New York Times can be found here. Love the challenge of solving riddles? TED Ed has more! Click here and find one that looks interesting and give it a try.

TED-Ed
Lesson Creator
New York, NY
Create and share a new lesson based on this one.
More from Math In Real Life
486,400 Views
Thinking & Learning
Can you survive the creation of the universe by solving this riddle?
Lesson duration 06:24
921,630 Views
938,766 Views
Mathematics
Can you solve the rogue submarine riddle? Difficulty level: Master
Lesson duration 06:19
1,130,320 Views