{"slug":"www-mahastrategies-com-api-v1-compute-robotics-grid-dry-run-76ac03","title":"Deterministic four-neighbor BFS on a grid of at most 24×24 cells","host":"www.mahastrategies.com","method":"POST","resource":"https://www.mahastrategies.com/api/v1/compute/robotics/grid-dry-run","category":"other","description":"Deterministic four-neighbor BFS on a grid of at most 24×24 cells. Returns a shortest obstacle-free route or an explicit unreachable/step-limit result. Toy discrete geometry only; no hardware, collision certification or physical feasibility claim. New modular adapter: retained result recovery for 24 ","price_listed":0.010025,"price_asked":null,"state":"no_terms","state_label":"Answers HTTP 429 without x402 payment terms","checks_7d":1,"answered_7d":0,"latency_ms_median":null,"reported_calls_30d":1,"reported_payers_30d":1,"networks":["eip155:8453"],"badge":"unverified","paid_checks_7d":0,"paid_ok_7d":0,"example_input":{"body":{"dataClass":"synthetic","goal":{"x":3,"y":0},"height":3,"maxSteps":8,"obstacles":[{"x":1,"y":0}],"start":{"x":0,"y":0},"width":4},"bodyType":"json","method":"POST","type":"http"},"output_schema":{"$schema":"https://json-schema.org/draft/2020-12/schema","properties":{"input":{"additionalProperties":false,"properties":{"body":{"additionalProperties":false,"properties":{"dataClass":{"enum":["public","synthetic"],"type":"string"},"goal":{"type":"object"},"height":{"maximum":24,"minimum":1,"type":"integer"},"maxSteps":{"maximum":575,"minimum":0,"type":"integer"},"obstacles":{"maxItems":576,"minItems":0,"type":"array"},"start":{"type":"object"},"width":{"maximum":24,"minimum":1,"type":"integer"}},"required":["dataClass","width","height","start","goal","obstacles","maxSteps"],"type":"object"},"bodyType":{"enum":["json","form-data","text"],"type":"string"},"method":{"enum":["POST"],"type":"string"},"type":{"const":"http","type":"string"}},"required":["type","method","bodyType","body"],"type":"object"},"output":{"properties":{"example":{"additionalProperties":false,"properties":{"data":{"type":"object"},"proof":{"type":"object"},"success":{"const":true}},"required":["success","data","proof"],"type":"object"},"type":{"type":"string"}},"required":["type"],"type":"object"}},"required":["input"],"type":"object"},"history":[{"day":"2026-10-18","reachable":true,"status":429,"valid_402":false,"asked_usdc":null,"price_match":null,"latency_ms":13,"error":null}],"description_full":"Deterministic four-neighbor BFS on a grid of at most 24×24 cells. Returns a shortest obstacle-free route or an explicit unreachable/step-limit result. Toy discrete geometry only; no hardware, collision certification or physical feasibility claim. New modular adapter: retained result recovery for 24 hours, minimal receipt metadata for 90 days. Existing live route unchanged.","last_updated":"2026-10-14T06:53:09.857Z","schemes":["exact"]}