forked from YovM/Algorithms
* Replacing the generator with numpy vector operations from lu_decomposition. * Revert "Replacing the generator with numpy vector operations from lu_decomposition." This reverts commit ad217c66165898d62b76cc89ba09c2d7049b6448. * Replacing the example in doctest with a less resource-intensive example. |
||
|---|---|---|
| .. | ||
| README.md | ||
| __init__.py | ||
| all_combinations.py | ||
| all_permutations.py | ||
| all_subsequences.py | ||
| coloring.py | ||
| combination_sum.py | ||
| hamiltonian_cycle.py | ||
| knight_tour.py | ||
| match_word_pattern.py | ||
| minimax.py | ||
| n_queens.py | ||
| n_queens_math.py | ||
| power_sum.py | ||
| rat_in_maze.py | ||
| sudoku.py | ||
| sum_of_subsets.py | ||
| word_search.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.