Tag: Chess

The knight that wouldn’t stop: Knuth’s 2025 detour into Knight’s Tours

If you’ve ever watched a knight dance across a chessboard and felt a little shiver of delight, Donald Knuth’s 2025 Christmas lecture was made for you. In early December he stepped away (briefly) from his life’s work and treated a packed Stanford auditorium to a warm, wide-ranging romp through the mathematics and art of Knight’s Tours — and announced new computational censuses that pin down long-standing curiosities about how a knight can visit every square exactly once. (thenewstack.io)

Why this matters (and why it’s beautiful)

• The Knight’s Tour is both an ancient puzzle and a modern graph‑theory problem: trace a path that visits each of an 8×8 board’s 64 squares exactly once using the knight’s L-shaped move.
• Beyond recreational math, studying Knight’s Tours touches combinatorics, symmetry, algorithm design, and the kinds of exhaustive enumeration problems that test both theory and computing power.
• Knuth’s framing emphasizes aesthetics: these tours aren’t just numbers — many are visually striking “snowflakes” or spirals with deep symmetry, and classifying them helps us see structure inside apparent chaos. (thenewstack.io)

Fresh results from the lecture

• Knuth described how dividing tours by the “wedges” formed at the four central squares reduces the search space (roughly by a factor of eight), letting him classify and count tours more systematically. (thenewstack.io)
• Using modern census programs and clusters of machines, he presented counts for very specific constrained families of tours — for example, 103,361,771,080 tours with a particular slope distribution among middle moves. (thenewstack.io)
• He highlighted the total number of Knight’s Tours often quoted in the literature: about 13,267,364,410,532 on an 8×8 board (a result first computed by Brendan McKay in 1997), and explained how the new censuses reveal fine-grained maxima and unique extremal tours (e.g., the only tour with exactly four obtuse angles). (thenewstack.io)
• Knuth also discussed constructions and surprising extrema: tours maximizing or minimizing certain angle counts, tours with many or few path crossings, and “whirling” tours with coil-like structure (including results on larger boards). (thenewstack.io)

How Knuth’s approach blends old and new

• Classic intuition: take symmetries, invariants, and small structural observations (like the wedge idea) that mathematicians have used for centuries.
• Modern tooling: write efficient enumerators, exploit data structures and symmetry reductions, and run massively parallel jobs on clusters to exhaustively search constrained families. Knuth described borrowing a 26‑machine cluster (832 cores) to crank through long runs — a modern echo of the “man vs. machine” era, where mathematical insight guides computation and computation finds structures intuition missed. (thenewstack.io)

Patterns, extremes, and human taste

• Some of the lecture’s most charming moments weren’t the big counts but the anecdotal extremes: the tours with the most straight lines, the ones with unusually many 37-degree wedges, those with minimal obtuse angles, or the single tour with exactly four obtuse angles.
• Knuth repeatedly returned to the notion that mathematical work, at its best, looks for beauty. He compared favorite tours to favorite pieces of music — patterns that please both left- and right‑brain sensibilities. (thenewstack.io)

Things this work nudges forward

• Enumeration practice: Knuth’s censuses are a reminder that clever classification plus raw compute still yields discoveries in classical problems.
• Visualization and design: the knight’s routes are fertile ground for “geek art” — architectural installations, prints, or teaching aids that make abstract combinatorics tangible (Knuth collaborated on decorations for Case Western’s reopened CS building). (thenewstack.io)
• New questions: now that many maxima/minima and specific census classes are known, attention can shift to provable constructions, asymptotic behavior on larger boards, and generalizations (3‑D boards, other piece-move graphs, or different topologies). (thenewstack.io)

A few technical highlights

• Wedge-based classification: analyzing the angles made at the four central squares cuts the enumeration problem into manageable families.
• Winding-number and darkness/lightness patterns: representing tours by black/white patterns (based on winding parity) gives a helpful invariant for classification and visualization.
• Parallel census runs: some calculations that would take many months on a desktop were completed in days using dozens of modern cores. Knuth noted running over 800 concurrent jobs for certain searches. (thenewstack.io)

What I find most striking

• It’s rare to see a living legend like Knuth combine playful curiosity, deep technical craft, and the joy of sharing results that are simultaneously rigorous and whimsical. The Knight’s Tour, an 1891‑era puzzle, remains a testing ground for fresh ideas about enumeration, symmetry, and what we call “beauty” in mathematics. (thenewstack.io)

My take

• This lecture is a small manifesto for computationally aided mathematics: human insight reduces the problem; machines exhaust the reduced space; both supply new stories and new questions.
• The work also reminds us that not all important progress looks like earth‑shattering theorems. Sometimes it’s counting, classifying, and revealing hidden patterns in well-worn territory — and that matters. Knuth’s delight in the tours is also an invitation: curiosity plus craft still pays dividends.

Final thoughts

Knuth’s Knight’s Tours lecture is equal parts computation, combinatorics, and gallery show. It’s a pragmatic lesson for researchers and hobbyists alike: embrace constraints that reveal structure, write clean code to enumerate wisely, and don’t forget to enjoy the images your work makes. After all, a solved count is more satisfying when it comes wrapped in symmetry, surprise, and a good story. (thenewstack.io)

Further reading

• Knuth’s Pre‑Fascicle on Hamiltonian Paths and Cycles (parts referenced in the talk).
• Historical background on Knight’s Tours and McKay’s 1997 total count.

Sources

• Donald Knuth’s 2025 Christmas Lecture: The Knight’s Tours — The New Stack
  https://thenewstack.io/donald-knuths-2025-christmas-lecture-the-knights-tours/ (thenewstack.io)

• Donald Knuth’s Annual Christmas Lecture 2025 — Stanford Events (event listing)
  https://events.stanford.edu/event/donald-knuths-annual-christmas-lecture-2025 (events.stanford.edu)

The Chess World in Turmoil: Allegations, Discipline, and a Tragic Loss

In the high-stakes world of chess, where every move can shift the balance of power in an instant, controversy can erupt just as quickly. Recently, the chess community has been rocked by serious allegations involving a former world champion and the late American grandmaster Daniel Naroditsky. As the International Chess Federation (FIDE) considers disciplinary action, the chess world is left grappling with the implications of these accusations and the tragic loss of a promising talent.

Context: A Chess Community Divided

The saga began when a prominent Russian former world champion made persistent allegations of cheating against Daniel Naroditsky, a well-respected American grandmaster. These claims were raised repeatedly over the course of a year leading up to Naroditsky’s untimely death, leaving many in the chess community both shocked and saddened.

Naroditsky was known not only for his skill on the board but also for his contributions to chess as a commentator and educator. His passing has left a void in the community, and the allegations against him have only intensified the sense of grief and confusion.

FIDE is now deliberating over whether to take disciplinary action against the former champion for his unproven claims, which many view as damaging to Naroditsky’s legacy. The situation raises important questions about accountability, the ethics of competition, and the impact of unfounded allegations in a community that thrives on trust and respect.

Key Takeaways

– Allegations of Cheating: A former world champion has made repeated, unproven cheating allegations against Daniel Naroditsky, stirring controversy in the chess community.

– Impact of Naroditsky’s Death: The allegations were made in the year leading up to the tragic passing of Naroditsky, which has deepened the emotional weight of the situation.

– FIDE’s Response: The International Chess Federation is considering disciplinary action against the former champion, highlighting the need for accountability in the chess world.

– Community Reaction: The chess community is polarized; many feel that the allegations tarnish Naroditsky’s legacy, while others are concerned about the implications for fair play.

– Ethics in Chess: This incident underscores the importance of integrity and ethical behavior in competitive sports, especially in a cerebral game like chess.

Concluding Reflection

As the chess world navigates this tumultuous period, it serves as a reminder of the delicate balance between competition and camaraderie. Allegations like these can have lasting impacts, not just on individuals but on the community as a whole. The legacy of players like Daniel Naroditsky deserves to be honored, and the chess world must strive to maintain an environment of trust and respect. As we await FIDE’s decision, one thing is clear: the game of chess is not just about kings and pawns; it’s also about the people who play and the integrity they uphold.

Sources

– AP News: Former world chess champion may face discipline for allegations against Daniel Naroditsky
– Chess.com: The Impact of Cheating Allegations in Chess
– FIDE: Ethics and Fair Play in Chess

By reflecting on these issues, we can work towards a future where chess remains a game of honor and respect—one move at a time.