Category: algorithms
Explore practical explanations of algorithms and computational problem-solving, from graph traversal and the Knight’s Tour to routing heuristics and combinatorial optimization.
Start here:
Optimization Problems Explained: Traveling Salesman, Job Shop Scheduling, and the Knight’s Tour — compare three combinatorial optimization problems and the heuristics used to tackle them.
Solving the Traveling Salesman Problem: Nearest Neighbor, 2-Opt, 3-Opt and Tabu Search — follow a practical progression from building a tour to improving it and escaping local optima.
Vibe Coding the Knight’s Tour with OpenAI Codex CLI — see a heuristic implemented and tested in a small coding project.
-
Solving the Traveling Salesman Problem: Nearest Neighbor, 2-Opt, 3-Opt and Tabu Search
Learn how nearest neighbor builds a Traveling Salesman tour, how 2-opt and 3-opt improve it, and how tabu search escapes…
-
Optimization Problems Explained: Traveling Salesman, Job Shop Scheduling, and the Knight’s Tour
What the Traveling Salesman Problem, Job Shop Scheduling, and the Knight’s Tour have in common — combinatorial explosion, NP-hardness, and…
-
Hands-On with OpenAI Codex CLI: Knight’s Tour Walkthrough & Code Review (2026)
A hands-on walkthrough with OpenAI Codex CLI: building an interactive Knight’s Tour solver with natural language prompts, AGENTS.md, diff review,…
-
South China Morning Post: China’s Tsinghua helps to break 40-year-old maths cap on computer speed
https://www.scmp.com/news/china/science/article/3321817/chinas-tsinghua-university-helps-break-40-year-old-maths-cap-computer-speed
-
Computer Scientists Establish the Best Way to Traverse a Graph
Dijkstra’s algorithm was long thought to be the most efficient way to find a graph’s best routes. Researchers have now…
-
NIST Announces Post-Quantum Cryptography Standards – IEEE Spectrum
https://spectrum.ieee.org/post-quantum-cryptography-2668949802
