mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-03-01 04:18:40 +00:00
Code Issues Packages Projects Releases Wiki Activity
314237d94e
Python/backtracking
History
Maxim Smolskiy f9cc25221c
Reduce the complexity of backtracking/word_search.py () 
* Lower the --max-complexity threshold in the file .flake8
2023-03-10 15:18:05 +05:30
..
__init__.py
Add __init__.py files in all the directories ()
2020-09-28 19:42:36 +02:00
all_combinations.py
Pyupgrade to Python 3.9 ()
2021-09-07 13:37:03 +02:00
all_permutations.py
Pyupgrade to Python 3.9 ()
2021-09-07 13:37:03 +02:00
all_subsequences.py
Pyupgrade to Python 3.9 ()
2021-09-07 13:37:03 +02:00
coloring.py
Fix comments in backtracking/coloring.py ()
2021-10-01 23:48:47 +02:00
combination_sum.py
Create combination_sum.py ()
2022-10-18 21:55:43 +02:00
hamiltonian_cycle.py
Remove useless code in doctests ()
2022-10-27 22:52:00 +02:00
knight_tour.py
refactor: Indent ... for visual purposes ()
2022-10-27 19:42:30 +02:00
minimax.py
Pyupgrade to Python 3.9 ()
2021-09-07 13:37:03 +02:00
minmax.py
Create minmax.py ()
2022-10-18 21:22:38 +02:00
n_queens_math.py
Make some ruff fixes ()
2023-03-01 17:23:33 +01:00
n_queens.py
Add pep8-naming to pre-commit hooks and fixes incorrect naming conventions ()
2022-10-13 00:54:20 +02:00
rat_in_maze.py
clean of unnecessary checks, imports, calls ()
2022-11-21 00:00:27 +13:00
README.md
Add README files 1/7 ()
2021-11-04 18:49:36 +08:00
sudoku.py
Pyupgrade to Python 3.9 ()
2021-09-07 13:37:03 +02:00
sum_of_subsets.py
Make some ruff fixes ()
2023-03-01 17:23:33 +01:00
word_search.py
Reduce the complexity of backtracking/word_search.py ()
2023-03-10 15:18:05 +05:30

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.