Core Insights - The article discusses the remarkable achievement of Claude, an AI model, which solved a 30-year-old problem in graph theory in just one hour, impressing Donald Knuth, a renowned computer scientist and Turing Award winner [2][5][12]. Group 1: AI Achievement - Claude utilized structural approaches like "fiber decomposition" and "snake-like construction" to derive a universal construction algorithm applicable to all odd m values after only 31 explorations [4][9]. - The problem involved determining if all arcs in a three-dimensional grid graph with m^3 vertices could be perfectly decomposed into three non-overlapping Hamiltonian cycles [6][10]. - Claude's solution process demonstrated logical reasoning and the ability to learn from errors, marking a significant advancement in AI's problem-solving capabilities [12][14]. Group 2: Donald Knuth's Perspective - Knuth, who had been skeptical about generative AI, expressed his admiration for Claude's achievement, stating "Hats off to Claude" [5][12]. - He highlighted that Claude's work was not merely a black-box result but a clear demonstration of logical reasoning and mathematical discovery [12]. - Knuth's long-standing engagement with the problem dates back to his work on "The Art of Computer Programming," showcasing the depth of the challenge [5][6]. Group 3: Historical Context - Donald Knuth is a legendary figure in computer science, having won the Turing Award at the age of 36 for his foundational contributions to algorithm analysis [18][19]. - His seminal work, "The Art of Computer Programming," is considered one of the most important scientific works of the 20th century, alongside Einstein's "Theory of Relativity" [22]. - Knuth's ongoing work on this series, which began in 1962, reflects his dedication to the field, with plans for seven volumes [24][26].