I must say that pathfinding has always fascinated me, because it’s a class of algorithms which produce visible and elegant output.

Broadly speaking, it’s a sort of procedural way of generating graphics.

I’m investigating different approaches to computing all the necessary graphs, trying to optimize paths when possible according to the geometry but this is not easy.

Underneath a classic A* algorithm is used, but procedurally placing the nodes ot the graph is proving itself harder than I though!