Singapore-based practical guides, tutorials and experiments in AI, computing, modelling, simulation, optimisation and quantum computing, with research notes and hands-on workflows.

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.

Browse by date
October 2026
M T W T F S S
 1234
567891011
12131415161718
19202122232425
262728293031