ConceptSystems & CS
Branch-and-bound pruning
Pruning branches in the search tree based on properties and cumulative costs once the bottom of the tree is reached.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Opens up
Concepts that name this one as a prerequisite.
Lecturers
2Each in their own terms, from the easiest level.
Jon Bentley
Stopping search paths early when the current accumulated cost plus any possible completion exceeds the current minimum solution found.
Lectures that assume it
1Connections
8The lectures that define it or assume it, and the concepts next to it.