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
The Beautiful Web
Jens Oliver Meiert
•
2 votes
2
When your coding agent doesn’t understand your project, you’ll get junk
Benjamin Cane
•
1 votes
3
LLM Use in the Python Source Code
Miguel Grinberg
•
1 votes
4
Wagon’s algorithm in Python
John D. Cook
•
1 votes
5
An example conversation with Claude Code
Dumm Zeuch
•
1 votes