Hamiltonian Paths in Antiquity - Stanford Lecture 2016
Offered By: Stanford University via YouTube
Course Description
Overview
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.
Syllabus
Stanford Lecture: Don Knuth—"Hamiltonian Paths in Antiquity" (2016) (360 Degrees)
Taught by
Stanford Online
Tags
Related Courses
Algorithms, Part IIPrinceton University via Coursera Intro to Algorithms
Udacity Analysis of Algorithms
Princeton University via Coursera 算法设计与分析 Design and Analysis of Algorithms
Peking University via Coursera Design and Analysis of Algorithms
Chennai Mathematical Institute via Swayam