Recursion And Backtracking Ladder

This ladder is for learning how to turn "try everything" into one honest search tree with state, branching, and pruning.

Who This Is For

Use this ladder when:

• recursive search feels ad hoc
• you keep writing brute force before deciding what one call frame means
• you need a clean boundary between backtracking, DP, and meet-in-the-middle

Warm-Up

• define one recursive state
• define one base case
• define one undo step

Core

• backtracking with legality pruning
• branch ordering
• deciding when the search tree is already too large

Compare Points Inside The Repo

• Bitmask DP
• Meet-In-The-Middle
• Complexity And Hardness
• Constructive

How To Use This Bridge

1. define the state before coding recursion
2. write the prune rule before optimizing syntax
3. if the tree is still too large, escalate to DP, MITM, or complexity triage

External Practice

• CSES Problem Set
• USACO Guide

Tutorial Link

• Recursion And Backtracking