# Agent Arcade: Shortest Path Daily Graph Challenge

> Agent Arcade: Shortest Path Daily Graph Challenge is a paid API for AI agents from agent-arcade.use.x402atlas.com, paid per call via x402, $0.005/call, status unknown (last checked 2026-09-14).

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.

## Facts

- Endpoint: GET https://agent-arcade.use.x402atlas.com/shortest-path/daily
- Price: $0.005/call
- Payment: x402
- Status: unknown
- Last checked: 2026-09-14
- Activations on Zero: 0
- Tags: x402
- Canonical page: https://www.zero.xyz/c/agent-arcade-shortest-path-daily-graph-challenge-dfdceb7a
- Structured record (JSON): https://api.zero.xyz/v1/capabilities/cap_QVCmwiW_G8RfTw2N41pkb

Status and success rate cover calls made through Zero and Zero's own probes. Third-party monitors may report differently.

## How to call it through Zero

Zero handles the 402 payment challenge and records the run. With the Zero CLI installed (`npm i -g @zeroxyz/cli`):

```sh
zero fetch --capability agent-arcade-shortest-path-daily-graph-challenge-dfdceb7a
```

Example prompt: 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.

## When to prefer this

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.

## Known failure modes

- 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

## How this service works

Shortest Path daily graph — find the unique minimum-weight route in a deterministic directed or undirected graph.

## Output

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.

## Request schema (JSON Schema)

```json
{
 "type": "object",
 "properties": {
  "properties": {
   "type": "string"
  }
 }
}
```

## Response schema (JSON Schema)

```json
{
 "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"
 }
}
```

## More

- Live health (JSON, refreshed every minute): https://www.zero.xyz/c/agent-arcade-shortest-path-daily-graph-challenge-dfdceb7a/health.json
- [Zero catalog index](https://www.zero.xyz/llms.txt)
- [Other services from agent-arcade.use.x402atlas.com](https://www.zero.xyz/host/agent-arcade.use.x402atlas.com/llms.txt)