{"resource":"https://www.mahastrategies.com/api/v1/micro/toy-grid-path-dry-run","service":"Toy grid path dry run","areas":["other"],"answering":true,"http_status":402,"latency_ms":493,"price_usdc":0.0345,"buyers_30d":1,"calls_30d":1,"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 ","id":"2e9c235c68f3","category":"Unclassified","accuracy":null,"tool_calls":null,"checked_day":"2026-10-11","page":"https://velliumandco.com/sellers/2e9c235c68f3"}