{"uid":"cap_pMZz1FAxCA9tQ7qfXRWeV","slug":"toy-grid-path-dry-run-27af58b6","name":"Toy Grid Path Dry Run","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 hours, minimal receipt metadata for 90 days. Existing live route unchanged.","url":"https://www.mahastrategies.com/api/v1/compute/robotics/grid-dry-run?utm_source=zero.xyz","method":"POST","headers":{},"bodySchema":{"type":"object","properties":{"goal":{"type":"object"},"start":{"type":"object"},"width":{"type":"integer","maximum":24,"minimum":1},"height":{"type":"integer","maximum":24,"minimum":1},"maxSteps":{"type":"integer","maximum":575,"minimum":0},"dataClass":{"enum":["public","synthetic"],"type":"string"},"obstacles":{"type":"array","maxItems":576,"minItems":0}}},"responseSchema":null,"example":null,"exampleRequest":null,"tags":["x402"],"displayCostAmount":"0.010025","displayCostAsset":"USDC","priceDynamic":false,"priceHint":null,"priceStatus":"priced","priceSource":"probe","requiresHandshake":false,"reviewCount":0,"rating":{"score":"0.00","successRate":"0.00","reviews":0,"stars":null,"state":"unrated"},"availabilityStatus":"unknown","priceObserved":null,"sessionDeposit":null,"pricing":{"kind":"static","summary":"$0.010025/call","primary":{"kind":"static","protocol":"x402","network":"base","amountUsd":"0.010025","per":"call","confidence":"exact"},"accepted":[{"kind":"static","protocol":"x402","network":"base","amountUsd":"0.010025","per":"call","confidence":"exact"}]},"paymentMethods":[{"uid":"pm_GIx8E3bkP398f_8_nPNPK","protocol":"x402","methodType":"crypto","chain":"base","mode":"charge","costAmount":"0.010025","costPer":"request","priority":0,"asset":"0x833589fCD6eDb6E08f4c7C32D4f71b54bdA02913","unit":"request","depositMicros":null,"planRef":null}],"brandName":null,"brandSlug":null,"brandBaseUrl":null,"brandDocsUrl":null,"whatItDoes":"Runs a deterministic four-neighbor BFS on a grid (up to 24×24) to find a shortest obstacle-free path or report unreachability within a step limit","exampleAgentPrompt":"Run a BFS pathfinding dry run on a 10×10 grid with start at (0,0) and goal at (9,9), treating cells (3,3), (3,4), (4,3), and (4,4) as obstacles, with a max of 200 steps, using synthetic data — tell me the shortest obstacle-free path or whether the goal is unreachable.","exampleUseCases":[{"title":"Verify robot path before deployment","prompt":"Before we send the robot out, do a grid dry run on a 12×8 layout with start at (0,0) and goal at (11,7), blocking cells (5,3), (5,4), (6,3), and (6,4), max 200 steps, synthetic data — is there a clear route and how many steps does it take?"},{"title":"Test maze solvability in a game prototype","prompt":"I'm building a puzzle game — can you check if a 20×20 maze is solvable? Start is (0,0), goal is (19,19), obstacles are at (10,0) through (10,18), max 400 steps, synthetic data. Tell me if there's a path and what it looks like."},{"title":"Validate warehouse layout for AGV routing","prompt":"Run a pathfinding check on our 24×24 warehouse grid for an AGV moving from (0,0) to (23,23) with shelves blocking cells (8,1)–(8,22) and (16,1)–(16,22), cap at 575 steps, public data class — does a valid route exist and what's the shortest one?"}],"resultDescription":"Returns either a shortest obstacle-free path (sequence of grid cells from start to goal) and its step count, or an explicit result indicating the goal is unreachable or the step limit was exceeded. Results are retained for 24 hours; receipt metadata is kept for 90 days.","failureModes":["Goal cell is unreachable due to obstacles fully blocking all paths — returns explicit unreachable status","Step limit (maxSteps) is too low to reach goal — returns step-limit-exceeded result","Grid dimensions exceed 24×24 — request rejected with validation error","Obstacle list contains more than 576 items — request rejected","Start or goal coordinates fall outside grid bounds — validation error","Invalid dataClass value (not 'public' or 'synthetic') — schema validation failure"],"whenToPreferThis":"Choose this endpoint when you need a fast, deterministic BFS shortest-path computation on a small discrete grid (up to 24×24) without any physical hardware, collision certification, or real-world robotics involvement. Ideal for simulation, game logic, prototype validation, or test harness scenarios using synthetic or public data where you need an authoritative shortest-path result or explicit unreachability confirmation within a configurable step budget.","instructions":null,"reviewSummary":null,"reviewSummaryHighlights":null,"reviewSummaryConcerns":null,"reviewSummaryGeneratedAt":null,"activationCount":0,"lastUsedAt":null,"lastSuccessfullyRanAt":null,"lastHealthCheckAt":"2026-10-28T06:46:25.636Z","isFirstParty":false,"canonicalSlug":"toy-grid-path-dry-run-27af58b6"}