Bounded solvers and checkers for sudoku, N-queens, Tower of Hanoi, magic squares, Game of Life, sliding puzzles and knight's tours.
payments ON MAINNET (real money) · 8 live endpoints
| Endpoint | Price | What it answers |
|---|---|---|
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. |
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. |
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. |
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. |
GET /sliding-puzzle | $0.02 | 8- or 15-puzzle: solvable by inversion parity? Optimal solution for 8-puzzle boards via IDA*, work-capped. |
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. |
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. |
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. |
GET /catalog returns this list as JSON. Activity hub · uptime.
Algorithmic puzzle solvers with hard work caps; inputs over the stated limits are refused. Computed locally, provided as is. Every paid response carries a disclaimer field.