Data Structures and Algorithm
(CC-2042)
Lecture 16
E N G R. D R B I L A L A S H FA Q A H M E D
S C H O O L O F S Y S T E M S A N D T E C H N O LO GY ( S S T )
C O M P U T E R S C I E N C E FA C U LT Y
, Recursive Backtracking
Backtracking is a problem-solving algorithmic technique that involves
finding a solution incrementally by trying different options and undoi
them if they lead to a dead end.
It is commonly used in situations where you need to explore multiple
possibilities to solve a problem, like searching for a path in a maze or
solving puzzles like Sudoku. When a dead end is reached, the algorithm
backtracks to the previous decision point and explores a different path
until a solution is found or all possibilities have been exhausted.
09/06/2025 DS
(CC-2042)
Lecture 16
E N G R. D R B I L A L A S H FA Q A H M E D
S C H O O L O F S Y S T E M S A N D T E C H N O LO GY ( S S T )
C O M P U T E R S C I E N C E FA C U LT Y
, Recursive Backtracking
Backtracking is a problem-solving algorithmic technique that involves
finding a solution incrementally by trying different options and undoi
them if they lead to a dead end.
It is commonly used in situations where you need to explore multiple
possibilities to solve a problem, like searching for a path in a maze or
solving puzzles like Sudoku. When a dead end is reached, the algorithm
backtracks to the previous decision point and explores a different path
until a solution is found or all possibilities have been exhausted.
09/06/2025 DS
