AlgoSim--

AlgoSim-- visualizes how computational algorithms actually work — from classical pathfinding to adaptive, learning-based navigation — on a dynamic 2D grid where every cell is a discrete computational unit. Each algorithm is an independent module behind a common interface, so the framework renders exploration, frontier expansion, learning, and convergence step-by-step in real time.

• Pathfinding suite: A*, Dijkstra, Dynamic A*, Bellman–Ford, and Greedy Best-First Search.
• Learning-based navigation: Ant Colony Optimization and Q-Learning grid navigation.
• Geometry and world dynamics: Bresenham line-of-sight and Conway's Game of Life cellular automata.
• Extensible modular architecture — new algorithms plug into the same interface without touching the core.