LIVE$APIEDCA0x720800690cd81c3319cb0ab9c4f480b659a772d4
APIED
Loading…
Loading prices…

Puzzle Solvers

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.

puzzle-solvers.x402tookit.comBaseSolanaPolygonArbitrum last paid 11h ago
Category
Other services
Starting price
$0.02
Paid calls · 30 days
4
Unique payers · 30 days
3

Paid endpoints

3 endpoints, sorted by usage. Prices are per request.