Laya vs Dijkstra

Same map, same start and goal. Dijkstra plans on the full weighted map. Laya walks it: four neighbours and the goal's direction per step, memory of where it has been, one local MLX forward pass per real choice.

Dijkstra

Global planner · sees the whole map · binary heap · optimal by construction

–path cost

–nodes settled

–path length

–compute

Laya MLX

Online navigator · local sensing · Trémaux memory shield

–route cost

–walked cost

–Laya decisions

–compute

Work steps Real time

Speed

floor · cost 1 mud · cost 3 water · cost 6 wall settled by Dijkstra visited by Laya passage closed (walked twice)

All scenarios

Map	Optimal cost	Laya route	Route / optimal	Laya walked	Random choice, same rules	Dijkstra	Laya	Laya decisions	ms / decision

“Route” is Laya's discovered start-to-goal path with its loops erased; “walked” includes every backtrack. The random column averages runs that choose uniformly among the same allowed moves, isolating what Laya's choices add. Dijkstra time is the median of unrecorded runs; Laya time is end-to-end, including every synchronized inference. All numbers come from the run that generated this page.