You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
23 lines
678 B
23 lines
678 B
7 months ago
|
---
|
||
|
|
comments: true
|
||
|
|
icon: material/map-marker-path
|
||
|
|
---
|
||
|
|
|
||
|
|
# Chapter 13. Backtracking
|
||
|
|
|
||
|
|
{ class="cover-image" }
|
||
|
|
|
||
|
|
!!! abstract
|
||
|
|
|
||
|
|
Like explorers in a maze, we may encounter difficulties on our path forward.
|
||
|
|
|
||
|
|
The power of backtracking allows us to start over, keep trying, and eventually find the exit to the light.
|
||
|
|
|
||
|
|
## Chapter contents
|
||
|
|
|
||
|
|
- [13.1 Backtracking algorithms](backtracking_algorithm.md)
|
||
|
|
- [13.2 Permutation problem](permutations_problem.md)
|
||
|
|
- [13.3 Subset sum problem](subset_sum_problem.md)
|
||
|
|
- [13.4 n queens problem](n_queens_problem.md)
|
||
|
|
- [13.5 Summary](summary.md)
|