Can you solve the Ragnarok riddle? - Dan Finkel

Summary by Krater

This video explores how to destroy the mythical serpent Jörmungandr using Euler's graph theory, explaining Eulerian paths, nodes, and edges.

From the video

Answers: How can graph theory solve the problem of destroying Jörmungandr?

• Ragnarok
• Jörmungandr
• Graph theory
• Eulerian path
• Nodes and edges

What it concludes

• A path must run along the entire body of the serpent without tracing the same section twice, crossing over at intersections.
• The edges are what we need to travel, and nodes connect the edges where choices are made.
• Every point along the path will have edges that come in pairs, one as entrance and the other as exit, meaning the number of edges coming out of every node must be even.
• Any connected network that has exactly two nodes with an odd number of edges will also contain an Eulerian path.