mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-11-24 05:21:09 +00:00
61eedc16c3
* refactor: Fix matrix display deprecation * refactor: Remove useless `print` and `pass` statements * revert: Replace broken doctests * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci * revert: Fix failing doctests * chore: Satisfy pre-commit Co-authored-by: pre-commit-ci[bot] <66853113+pre-commit-ci[bot]@users.noreply.github.com> |
||
---|---|---|
.. | ||
__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_math.py | ||
n_queens.py | ||
rat_in_maze.py | ||
README.md | ||
sudoku.py | ||
sum_of_subsets.py |
Backtracking
Backtracking is a way to speed up the search process by removing candidates when they can't be the solution of a problem.