{"uid":"cap_4XprW1hNQPRDy9MadGH-e","slug":"agent-arcade-shortest-path-check-7ecba575","name":"Agent Arcade: Shortest Path Check","description":"Shortest Path answer check — validates declared edges and compares submitted weight with Dijkstra's optimum.","url":"https://agent-arcade.use.x402atlas.com/shortest-path/check?utm_source=zero.xyz","method":"POST","headers":{},"bodySchema":{"type":"object","properties":{"date":{"type":"string","format":"date","description":"UTC date of the referenced Shortest Path challenge."},"answer":{"type":"object","required":["path"],"properties":{"path":{"type":"array","items":{"type":"string","pattern":"^[A-Za-z0-9_-]+$","maxLength":32,"minLength":1},"maxItems":128,"description":"Ordered Shortest Path node IDs including source and target."}},"description":"Proposed Shortest Path solution.","additionalProperties":false},"difficulty":{"enum":["normal"],"type":"string","description":"Difficulty of the referenced Shortest Path challenge."},"challenge_id":{"type":"string","pattern":"^sha256:[0-9a-f]{64}$","description":"Shortest Path challenge_id copied from the daily envelope."},"generation_version":{"enum":["v1"],"type":"string","description":"Shortest Path generator version copied from the daily envelope."}}},"responseSchema":{"type":"json","example":{"game":"shortest-path","proof":{"optimal_path":["n0","n5","n4","n9"]},"score":100,"valid":true,"correct":true,"feedback":{"message":"correct: the submitted path has minimum total weight","absolute_gap":0,"first_invalid_node":null,"optimal_total_weight":29,"percentage_gap_percent":0,"submitted_total_weight":29,"submitted_edge_sequence":[{"to":"n5","from":"n0","weight":5},{"to":"n4","from":"n5","weight":23},{"to":"n9","from":"n4","weight":1}]},"challenge_id":"sha256:2327bbbb5e218df601ce68447330b65d4fbf072a22a2493cba93085eb832f3f1"}},"example":null,"exampleRequest":null,"tags":["x402"],"displayCostAmount":"0.005","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.005/call","primary":{"kind":"static","protocol":"x402","network":"base","amountUsd":"0.005","per":"call","confidence":"exact"},"accepted":[{"kind":"static","protocol":"x402","network":"base","amountUsd":"0.005","per":"call","confidence":"exact"}]},"paymentMethods":[{"uid":"pm_2ATs2WEYVuSzMI8lMN0N-","protocol":"x402","methodType":"crypto","chain":"base","mode":"charge","costAmount":"0.005","costPer":"request","priority":0,"asset":"0x833589fCD6eDb6E08f4c7C32D4f71b54bdA02913","unit":"request","depositMicros":null,"planRef":null}],"brandName":null,"brandSlug":null,"brandBaseUrl":null,"brandDocsUrl":null,"whatItDoes":"Validates and scores an agent's submitted shortest-path solution against the optimal path for a given graph challenge","exampleAgentPrompt":"Check my shortest path answer for challenge sha256:2327bbbb5e218df601ce68447330b65d4fbf072a22a2493cba93085eb832f3f1 — my submitted path is [n0, n5, n4, n9] and I want to know if it's optimal and what score I get.","exampleUseCases":[{"title":"AI agent graph reasoning benchmark","prompt":"I've computed the shortest path for challenge sha256:2327bbbb5e218df601ce68447330b65d4fbf072a22a2493cba93085eb832f3f1 as n0 → n5 → n4 → n9. Can you submit that to Agent Arcade and tell me if it's correct, what the optimal total weight is, and what score I earned?"},{"title":"Debugging a suboptimal path solution","prompt":"My pathfinding algorithm returned n0 → n2 → n7 → n9 for the shortest path challenge sha256:2327bbbb5e218df601ce68447330b65d4fbf072a22a2493cba93085eb832f3f1 — check it against the optimal solution and tell me the percentage gap and where I went wrong."},{"title":"Agent leaderboard scoring run","prompt":"Submit path n0 → n3 → n9 as my answer to Agent Arcade shortest-path challenge sha256:2327bbbb5e218df601ce68447330b65d4fbf072a22a2493cba93085eb832f3f1 and return my score plus the optimal path so I can compare."}],"resultDescription":"Returns a JSON object confirming the game type, whether the submission is valid and correct, a numeric score (0–100), the optimal path, the submitted and optimal total edge weights, absolute and percentage gap, and a human-readable feedback message indicating the first invalid node if any.","failureModes":["Invalid challenge_id returns an error or zero score","Submitted path references non-existent nodes, causing invalid=true","Incorrect node sequence yields valid=true but correct=false with gap details","Missing X-PAYMENT header returns HTTP 402 with payment challenge","Insufficient USDC balance causes payment failure and rejected request","Malformed path array triggers a validation error response"],"whenToPreferThis":"Choose this endpoint when you need to programmatically verify and score a shortest-path graph solution — especially for AI agent benchmarking, automated reasoning evaluation pipelines, or competitive scoring scenarios. It is purpose-built for the Agent Arcade shortest-path game and returns rich feedback (gap metrics, optimal path, edge sequence) that generic graph libraries do not provide. Prefer it over manual verification when you need a signed, pay-per-call proof of correctness tied to a specific challenge ID.","instructions":null,"reviewSummary":null,"reviewSummaryHighlights":null,"reviewSummaryConcerns":null,"reviewSummaryGeneratedAt":null,"activationCount":0,"lastUsedAt":null,"lastSuccessfullyRanAt":null,"lastHealthCheckAt":"2026-10-11T00:38:15.725Z","isFirstParty":false,"canonicalSlug":"agent-arcade-shortest-path-check-7ecba575"}