Examples
Examples
Try the starting example
- Pick locations: name, x metres, y metres
- A,2,0 B,2,3 C,0,3
- Start X (m)
- 0
- Start Y (m)
- 0
- End X (m)
- 0
- End Y (m)
- 0
- Nearest-neighbour pick order
- A → B → C
- Total rectilinear distance (m)
- 10
- Distance by route leg (m)
- 2, 3, 2, 3
Try another scenario
- Pick locations: name, x metres, y metres
- P,1,1 Q,3,1
- Start X (m)
- 0
- Start Y (m)
- 0
- End X (m)
- 4
- End Y (m)
- 1
- Nearest-neighbour pick order
- P → Q
- Total rectilinear distance (m)
- 5
- Distance by route leg (m)
- 2, 2, 1
Calculation method
Calculation method
Nearest-neighbour pick order
Starting at the supplied origin, choose the unvisited pick with least Manhattan distance; input order breaks ties. Append the supplied endpoint.
Total rectilinear distance (m)
Sum absolute x movement plus absolute y movement over all route legs.
Distance by route leg (m)
Report those leg distances in route order, including the final return/end leg.
Symbols and units
- a
- Pick locations: name, x metres, y metres
- b
- Start X (m)
- c
- Start Y (m)
- d
- End X (m)
- e
- End Y (m)
Use the units shown. A list keeps the order in which you enter its values. The symbol ^ means “raised to the power of”.
Assumptions & limits
Assumptions & limits
- Rectilinear distance model for an open interconnected orthogonal aisle grid. It does not know rack barriers, one-way aisles or accessible routes. The nearest-neighbour route is a heuristic, not a shortest-route guarantee; use measured coordinates in one consistent origin.
Are these inputs private?
These calculations run in your browser. A shared link contains the values you choose to share. Only questions submitted to the separate AI finder are sent to OpenAI.
Further reading
OpenStax: arithmetic and geometry ↗
Background reading; this does not imply endorsement or independent review of SumFizz.