The native example, compiled to WebAssembly

See where pathfinding work is reused

Every route and counter below comes from the same C++ model as the self-checking example. Animation explains call order; it is not a browser performance measurement.

Comparable requests intentionally match; the cache card repeats its first request. Compare the operation chain above each map to see where tess repeats work and where it reuses it. Violet coverage on the distance-field map represents the exact C++-reported reachable-tile count, not invented distance values.

Loading WebAssembly…

Independent A*

Data product: query-local search scratch, then one returned path per call

Search 1 Search 2 Search 3

Waiting for C++…

Exact route cache

Data product: one stored route and suffixes, addressable by an exact repeat

Miss + search Hit + reuse

Waiting for C++…

Weighted batch

Data product: one internally bounded field for the group, then scratch-backed result paths

3 requests 1 grouped field 3 results

Waiting for C++…

Distance field

Data product: caller-owned labels over reachable tiles, then paths read from any start

Build field Read 1 Read 2 Read 3

Waiting for C++…

What the C++ calls reported

Strategy Request shape and call sequence Returned paths and reuse facts