Knight’s tour with fewest obtuse angles
Read OriginalThis article discusses a specific knight's tour chess problem highlighted in Donald Knuth's 29th annual Christmas lecture. It focuses on the unique solution for a knight's tour that minimizes the number of obtuse angles in its path, a solution Knuth described as particularly beautiful. The post references the lecture and connects to other related mathematical and programming topics like knight's tours on infinite boards and magic squares.
Comments
No comments yet
Be the first to share your thoughts!
Browser Extension
Get instant access to AllDevBlogs from your browser
Top of the Week
1
Quoting Thariq Shihipar
Simon Willison
•
2 votes
2
Top picks — 2026 January
Paweł Grzybek
•
1 votes
3
In Praise of –dry-run
Henrik Warne
•
1 votes
4
Deep Learning is Powerful Because It Makes Hard Things Easy - Reflections 10 Years On
Ferenc Huszár
•
1 votes
5
Vibe coding your first iOS app
William Denniss
•
1 votes
6
AGI, ASI, A*I – Do we have all we need to get there?
John D. Cook
•
1 votes
7
Dew Drop – January 15, 2026 (#4583)
Alvin Ashcraft
•
1 votes