mirror of
https://hub.njuu.cf/TheAlgorithms/Python.git
synced 2023-10-11 13:06:12 +08:00
5bfcab1aa4
* Create minmax.py * Update minmax.py * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci Co-authored-by: Christian Clauss <cclauss@me.com> 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 | ||
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.