Google, IBM & Meta Certificates — All 10,000+ Courses at 40% Off
One annual plan covers every course and certificate on Coursera. 40% off for a limited time.
Get Full Access
Explore the fascinating history of Hamiltonian paths in this Stanford lecture by renowned computer scientist Donald Knuth. Delve into the origins of the Icosian Game, invented by William Rowan Hamilton around 1850, which involves finding a path that encounters all points of a network without retracing steps. Discover how variants of this game have become crucial in modern computer applications. Uncover evidence suggesting that interest in such questions dates back to Graeco-Roman times, and examine ingenious Sanskrit and Arabic documents from the ninth century onwards. Learn why this problem may be considered the oldest nontrivial combinatorial challenge in the history of civilization. Gain insights from Knuth, the "father" of algorithm analysis and author of The Art of Computer Programming, as he presents this captivating 72-minute Christmas Tree Lecture in 360-degree format.
