See what we can offer to your school
"SimpleStudy just makes sense...”
Get the best plan for your school
15 cards from this deck
Technique to systematically search solutions; abandons invalid paths to try alternatives
Decision trees, combinatorial optimisation, constraint satisfaction
Abandons path and tries different one
Choose a path/start with initial partial solution
Expand if valid, backtrack if invalid
Place NNN queens on N×NN \times NN×N board, none threaten each other
Explores all possibilities in organised manner
Quickly eliminates paths not meeting constraints
Simple to implement using recursion
Inefficient, may explore many possibilities
O(2n)O(2^n)O(2n) for certain problems
Leads to incorrect solutions
Causes infinite recursion
Combinatorial and constraint satisfaction problems
Can lead to stack overflow for deep recursive calls
Select your subjects, and get access to A+ resources today.