# Puzzle Solvers

Bounded solvers and checkers for sudoku, N-queens, Tower of Hanoi, magic squares, Game of Life, sliding puzzles and knight's tours.

## How to pay

Machine-payable over x402. USDC on: Base (eip155:8453), Solana (solana:5eykt4UsFv8P8NJdTREpY1vzqKqZKvdp), Polygon (eip155:137), Arbitrum One (eip155:42161).
No accounts. No API keys. No signup. The paying wallet is the account.

## Machine-readable

- OpenAPI: https://puzzle-solvers.x402tookit.com/openapi.json
- x402 manifest: https://puzzle-solvers.x402tookit.com/.well-known/x402
- Catalog (free): https://puzzle-solvers.x402tookit.com/catalog
- Health (free): https://puzzle-solvers.x402tookit.com/health
- Uptime (free): https://puzzle-solvers.x402tookit.com/uptime

## Endpoints (8)

### GET /game-of-life — $0.02
Step Conway's Game of Life on a grid up to 40x40 for 1-50 generations, bounded or wrapping; detects still lifes and cycles.
Params: grid: string, generations?: integer, wrap?: boolean
Example: https://puzzle-solvers.x402tookit.com/game-of-life?grid=.%23.%2F.%23.%2F.%23.&generations=1

### GET /knights-tour-check — $0.02
Verify a knight's tour on an n x n board (n up to 26): legal moves, repeats, complete tour, closed tour.
Params: n: integer, moves: string
Example: https://puzzle-solvers.x402tookit.com/knights-tour-check?n=5&moves=a1+b3+c1+d3+e1

### GET /magic-square — $0.02
Generate an n x n magic square (Siamese, doubly-even or Strachey method) or verify a grid; constant n(n^2+1)/2.
Params: n?: integer, grid?: string
Example: https://puzzle-solvers.x402tookit.com/magic-square?n=4

### GET /n-queens — $0.02
Count the ways to place n non-attacking queens on an n x n board (n up to 12) and show the first solution.
Params: n: integer
Example: https://puzzle-solvers.x402tookit.com/n-queens?n=8

### GET /sliding-puzzle — $0.02
8- or 15-puzzle: solvable by inversion parity? Optimal solution for 8-puzzle boards via IDA*, work-capped.
Params: board: string, solve?: boolean
Example: https://puzzle-solvers.x402tookit.com/sliding-puzzle?board=8%2C6%2C7%2C2%2C5%2C4%2C3%2C0%2C1

### GET /sudoku-solve — $0.02
Solve a 9x9 sudoku (81 chars, 0 or . blank): solution, solution count up to 2, unique or multi, or unsolvable.
Params: grid: string
Example: https://puzzle-solvers.x402tookit.com/sudoku-solve?grid=53..7....6..195....98....6.8...6...34..8.3..17...2...6.6....28....419..5....8..79

### GET /sudoku-validate — $0.02
Check a 9x9 sudoku grid for repeated digits by row, column and box; says if it is legal, complete or solved.
Params: grid: string
Example: https://puzzle-solvers.x402tookit.com/sudoku-validate?grid=534678912672195348198342567859761423426853791713924856961537284287419635345286179

### GET /tower-of-hanoi — $0.02
Optimal Tower of Hanoi move list for up to 10 disks between pegs A, B and C, and the minimum move count 2^n - 1.
Params: n: integer, from?: string, to?: string
Example: https://puzzle-solvers.x402tookit.com/tower-of-hanoi?n=3

## Terms

Algorithmic puzzle solvers with hard work caps; inputs over the stated limits are refused. Computed locally, provided as is.