Branch and Bound
Backtracking with a bound; prune any branch whose best possible outcome cannot beat the current best.
Decision · step 2 of 7Branch and Bound: Four items, most of the tree cut
Deciding item A with nothing taken, weight 0 of 5, value 0. Fill the remaining 5 optimistically, fractions allowed: the bound is 7. The best complete answer is 0. The bound is higher, so the branch might still win: explore it, taking A first.
What you will see
Nodes show their bound; branches with a bound worse than the incumbent are cut.
Cost
| Space | O(depth) |
|---|
How you work with it here
play it through, step one change at a time, compare two runs.
Screen readers: Each paradigm lesson is narrated as the characteristic loop it performs; the comparison view is available as a table.
Reduced motion: Side-by-side panes update in place.