Field-Based Pathfinding: A Quantum-Inspired Alternative to A*

2 points

a year ago

I’ve been experimenting with a lightweight algebraic system for quantum-like transformations and built a pathfinding engine out of it. Instead of using traditional heuristics like in A*, it uses a quantum equality (XY = X/Y) as the initializer to navigate grids.

The result is a pathfinder that feels "intelligent" without needing heavy heuristic design, and scales surprisingly well on large grids.

The full repo includes the quantum algebra system (Qualge) behind it and some visualizations for sorting and grid transformations.

Repo: https://github.com/ElSolem/qualge

Would love feedback or ideas for other systems this could apply to.

2 comments