Backtracking Algorithms

Algorithms that explore candidates and abandon partial solutions.

  • Algorithms
  • 12 entries
  • 6 sections
  • CC0 — public domain

The data

0

Problem
N-Queens
Description
Place N non-attacking queens on an NxN chessboard.

1

Problem
Sudoku Solver
Description
Fill a 9x9 grid satisfying row, column, and box constraints.

2

Problem
Subset Sum
Description
Find a subset whose sum equals a target value.

3

Problem
Graph Coloring
Description
Assign colors to vertices so adjacent vertices differ.

4

Problem
Hamiltonian Cycle
Description
Find a cycle that visits every vertex exactly once.

5

Problem
Maze Solving
Description
Find a path from start to goal through a maze.

Fetch the same bytes

The static files are identical to what the API returns, but with no rate limit and no server round trip. Use the API when you want a query and a content type; use the files when you want to cache one document. 

curl "https://yjtoon.com/api/dataset/backtracking-algorithms?format=toon"
const res = await fetch(
  "https://yjtoon.com/static-data/dataset/backtracking-algorithms.toon"
);
const toon = await res.text();

Rate limit: 120 requests per minute per IP, no key and no signup. API reference →

Topics

  • algorithms
  • backtracking
  • recursion