Skip to main content
grasp.study
About
Explore
Pricing
Log in
Try it for free
Back to course
👋
Welcome to a Grasp lesson
Create a free account
to keep studying and create your own study path.
Learn widely used algorithms
·
Module 10
Solving Problems with Backtracking
1
Backtracking: Depth-First Search in State-Space Trees
Describe the backtracking paradigm as a form of depth-first search on a state-space tree.
2
Solving N-Queens with Backtracking
Apply backtracking to solve the N-Queens problem.
3
Backtracking for Combinatorial Search: Sudoku Example
Apply backtracking to solve combinatorial search problems like Sudoku.
4
Pruning for Backtracking Optimization
Implement pruning strategies to optimize backtracking algorithms by reducing the search space.
End of course,
Back to course
Previous module
Advanced Algorithmic Patterns
Next module