Algorithm visualizations
Short guides for classic algorithms, each paired with a live interactive demo on AlgoScape. New visualizations land here as they ship.
-
A* pathfinding
How A* finds shortest paths with f(n) = g(n) + h(n), compared with Dijkstra and greedy best-first search — plus a browser grid demo.
-
Genetic algorithm
Genetic algorithms from selection, crossover, and mutation to an animated fitness demo that evolves a binary string toward more 1s.
-
Iterative local search (ILS)
Iterative local search escapes local optima with perturbation and acceptance criteria — visualized alongside tabu search on continuous landscapes.
-
Fractal generator
Generate Mandelbrot-style fractals in the browser — the math of complex iteration, escape-time coloring, and links to pattern and finance applications.
-
TSP with iterative local search
Traveling salesman tours improved by iterative local search — watch city routes shorten as perturbation and local improvement iterate.
Also listed in Portfolio under AlgoScape.