cpu_next_hops
List eligible next hops from any cell under the reach rule, showing distance, ownership, hub status, build state, and transit fees to plan and chain cargo waypoints.
Instructions
Survey the legal next waypoints from a cell (read-only). Lists every eligible waypoint within one hop under the reach rule: hop ≤ radius(from)+radius(to)−1 grid steps. Eligible means Virgin ground (isVirgin — no completed reveal yet, minted or not, owner null when nobody has minted it), any cell you own, or any cell carrying a finished Hub, foreign ones included. Only foreign land past its first completed reveal without a finished Hub is closed — that, not open ground, is the WALL: a belt of foreign revealed cells wider than your reach stops cargo until a finished Hub reaches across. Waypoints are passage only: a shipment still starts and ends on your own revealed cells. Radius is per cell, never global: a plain cell (Virgin ground included) carries the move radius and each finished Hub tier carries the radius its own catalog row serves, so fromRadius on the origin and radius on every candidate is what you add up. A Hub counts only once its construction finishes: until then it grants no hub reach and charges no fee, and a foreign one is no waypoint at all — fromReady says whether your own origin is still building, which is why its reach may be smaller than you expect. Empty hops means goods can only be hauled up to here. Facts per candidate: hop distance, owner, hub and Virgin flags, ready build state, the exact per-unit transit fee for your resourceId cargo (your own cells charge none, a Hub of your own on them included, and so does bare Virgin ground — but a foreign finished Hub charges its fee even on a cell with no completed reveal), and — with towards — the remaining grid distance (a compass, not a route). Planning is YOUR job: pick each hop yourself (cheap vs short vs whose hub you trust), chain them into path, and verify with cpu_quote_transport. To break a wall: build a border Hub (it still needs an eligible landing cell within reach on the far side), buy land across, or go around. Routing is refused until the whole map has loaded, so a missing row can never pass as open ground. WHEN: the cheap point check — call it right before each leg and after cpu_get_changes shows movement (hubs get demolished, fees change while goods travel); replan via cpu_route_network only when a local fix is impossible. Pass lotId to survey one lot’s way home instead: for an Evicted lot the origin becomes the hub it was listed on, admitted from the lot itself at the reach recorded there, whatever stands on that cell now. Only the origin changes — every candidate is still judged on today’s map — and the chain you build is verified with cpu_quote_lot_return.
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| from | Yes | The cell to hop from — where the cargo stands now: your own cell, a cell with a finished Hub, or Virgin ground (no completed reveal). | |
| lotId | No | Optional lot id — plan the way home for this lot instead of an ordinary shipment. For an Evicted lot the source is the hub it was listed on, admitted from the lot itself with the reach and the rate recorded there, so the plan survives that hub being demolished, rebuilt or sold. Nothing after the source changes: the destination is still your own revealed cell and every waypoint follows the ordinary rules. Verify the chain with cpu_quote_lot_return. | |
| towards | No | Optional destination — adds the remaining grid distance to it for each candidate (a compass). | |
| resourceId | Yes | The cargo resource id — each candidate hub shows its exact per-unit transit fee for it. |