mirror of https://github.com/TheAlgorithms/Python.git synced 2026-03-13 09:50:19 +08:00

Files

Maxim Smolskiy f9cc25221c Reduce the complexity of backtracking/word_search.py (#8166 )

* Lower the --max-complexity threshold in the file .flake8

2023-03-10 15:18:05 +05:30

__init__.py

…

all_combinations.py

…

all_permutations.py

…

all_subsequences.py

…

coloring.py

…

combination_sum.py

…

hamiltonian_cycle.py

2022-10-27 22:52:00 +02:00

knight_tour.py

…

minimax.py

…

minmax.py

…

n_queens_math.py

2023-03-01 17:23:33 +01:00

n_queens.py

…

rat_in_maze.py

2022-11-21 00:00:27 +13:00

README.md

…

sudoku.py

…

sum_of_subsets.py

2023-03-01 17:23:33 +01:00

word_search.py

2023-03-10 15:18:05 +05:30

Backtracking

Backtracking is a way to speed up the search process by removing candidates when they can't be the solution of a problem.