Backtracking

Explores all possible choices recursively and 'backtracks' when a choice leads to a dead end.

The Approach

Define a recursive function that explores solutions from a given state.
Loop through all possible choices at the current step.
For each choice, add it to the current solution path ('choose').
Make a recursive call to explore further.
After the recursive call returns, undo the choice ('un-choose' or 'backtrack') to explore other paths.

Generate all possible orderings of a set of elements.

Start exploring choices.

Generate all possible combinations of elements.

Start exploring choices.

Find solutions that satisfy a set of constraints, like Sudoku or N-Queens.

Start exploring choices.

Backtracking

Backtracking

Backtracking

Backtracking

Backtracking