forked from YovM/Algorithms
* Create combination_sum.py * Update DIRECTORY.md * Adds doctests Co-authored-by: Christian Clauss <cclauss@me.com> * Update combination_sum.py * Update combination_sum.py Co-authored-by: Christian Clauss <cclauss@me.com> |
||
|---|---|---|
| .. | ||
| README.md | ||
| __init__.py | ||
| all_combinations.py | ||
| all_permutations.py | ||
| all_subsequences.py | ||
| coloring.py | ||
| combination_sum.py | ||
| hamiltonian_cycle.py | ||
| knight_tour.py | ||
| minimax.py | ||
| minmax.py | ||
| n_queens.py | ||
| n_queens_math.py | ||
| rat_in_maze.py | ||
| sudoku.py | ||
| sum_of_subsets.py | ||
README.md
Backtracking
Backtracking is a way to speed up the search process by removing candidates when they can't be the solution of a problem.