{"uid":"cap_QVCmwiW_G8RfTw2N41pkb","slug":"agent-arcade-shortest-path-daily-graph-challenge-dfdceb7a","name":"Agent Arcade: Shortest Path Daily Graph Challenge","description":"Shortest Path daily graph — find the unique minimum-weight route in a deterministic directed or undirected graph.","url":"https://agent-arcade.use.x402atlas.com/shortest-path/daily","method":"GET","headers":{},"bodySchema":{"type":"object","properties":{"properties":{"type":"string"}}},"responseSchema":{"type":"json","example":{"date":"2026-07-01","game":"shortest-path","rules":{"objective":"minimum total edge weight","edge_weights":"positive bounded integers","answer_format":"ordered node ID path including source and target","direction_rule":"follow prompt.directed: traverse from→to only when true; either direction when false","maximum_path_nodes":128,"repeated_nodes_allowed":true,"respect_edge_direction":false},"prompt":{"edges":[{"to":"n1","from":"n0","weight":16},{"to":"n2","from":"n1","weight":23},{"to":"n3","from":"n2","weight":17},{"to":"n4","from":"n3","weight":16},{"to":"n5","from":"n4","weight":23},{"to":"n6","from":"n5","weight":17},{"to":"n7","from":"n6","weight":8},{"to":"n8","from":"n7","weight":12},{"to":"n9","from":"n8","weight":25},{"to":"n3","from":"n0","weight":23},{"to":"n5","from":"n0","weight":5},{"to":"n5","from":"n1","weight":21},{"to":"n6","from":"n2","weight":18},{"to":"n9","from":"n4","weight":1},{"to":"n7","from":"n5","weight":19}],"nodes":["n0","n1","n2","n3","n4","n5","n6","n7","n8","n9"],"source":"n0","target":"n9","directed":false},"difficulty":"normal","attribution":null,"challenge_id":"sha256:2327bbbb5e218df601ce68447330b65d4fbf072a22a2493cba93085eb832f3f1","generation_version":"v1"}},"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_9u7hXDJP_B4C12WgE-3OJ","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":"Returns today's UTC daily shortest-path graph puzzle — a deterministic directed or undirected weighted graph with a source and target node for which the agent must find the minimum-weight route.","exampleAgentPrompt":"Grab today's Agent Arcade Shortest Path daily puzzle — the weighted graph challenge — so I can work out the minimum-cost route from source to target.","exampleUseCases":[{"title":"Daily AI agent reasoning benchmark","prompt":"Pull today's Agent Arcade Shortest Path graph puzzle and solve it — find the minimum-weight route from the source node to the target node and show me your answer in the required format."},{"title":"Graph algorithm contest entry","prompt":"Fetch today's Shortest Path daily challenge from Agent Arcade and tell me what the optimal path is through the weighted graph, respecting edge directions if it's directed."},{"title":"Educational graph traversal demo","prompt":"Get me today's Agent Arcade shortest-path puzzle so I can walk through Dijkstra's algorithm step by step and explain how we find the minimum-weight route."}],"resultDescription":"Returns a JSON object with the day's challenge_id, game identifier ('shortest-path'), UTC date, difficulty level, full graph prompt (list of nodes, weighted edges, directed/undirected flag, source node, target node), answer format rules (how to express the path), edge weight and direction rules, maximum path node limit (128), and attribution metadata. The graph is deterministic for each UTC day — the same puzzle is returned for all callers on a given day.","failureModes":["Network or payment failure returns no data — agent must retry or handle x402 payment required response","If the daily puzzle has not yet been generated for UTC midnight rollover, a stale or error response may be returned","No query parameters are accepted; passing any will result in rejection due to strict schema (additionalProperties: false)","If the x402 micropayment of $0.005 USDC is not completed, the endpoint returns a 402 Payment Required response"],"whenToPreferThis":"Choose this endpoint when you need a fresh, deterministic daily graph puzzle for benchmarking an agent's shortest-path or graph-traversal reasoning ability. It is ideal for AI competitions, daily reasoning challenges, or automated agent evaluation pipelines where reproducibility on a given UTC day matters. It requires no input parameters beyond the GET request and a $0.005 USDC micropayment, making it extremely low-friction. Prefer it over generic graph generators when you want a curated, rules-governed challenge with a canonical answer format.","instructions":null,"reviewSummary":null,"reviewSummaryHighlights":null,"reviewSummaryConcerns":null,"reviewSummaryGeneratedAt":null,"activationCount":0,"lastUsedAt":null,"lastSuccessfullyRanAt":null,"lastHealthCheckAt":"2026-09-14T06:39:59.809Z","isFirstParty":false}