Independent A*
Data product: query-local search scratch, then one returned path per call
Waiting for C++…
The native example, compiled to WebAssembly
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.
Data product: query-local search scratch, then one returned path per call
Waiting for C++…
Data product: one stored route and suffixes, addressable by an exact repeat
Waiting for C++…
Data product: one internally bounded field for the group, then scratch-backed result paths
Waiting for C++…
Data product: caller-owned labels over reachable tiles, then paths read from any start
Waiting for C++…
| Strategy | Request shape and call sequence | Returned paths and reuse facts |
|---|