mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2024-11-27 15:01:08 +00:00
Code Issues Packages Projects Releases Wiki Activity
04b896124a
Python/backtracking
History
Christian Clauss 0f4e51245f
Upgrade to Python 3.12 (#9576) 
* DRAFT: GitHub Actions: Test on Python 3.12

Repeats #8777
* #8777 

Some of our dependencies will not be ready yet.

* Python 3.12: Disable qiskit and tensorflow algorithms

* updating DIRECTORY.md

---------

Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
2023-10-03 14:47:10 +05:30
..
__init__.py Add __init__.py files in all the directories (#2503) 2020-09-28 19:42:36 +02:00
all_combinations.py Pyupgrade to Python 3.9 (#4718) 2021-09-07 13:37:03 +02:00
all_permutations.py Pyupgrade to Python 3.9 (#4718) 2021-09-07 13:37:03 +02:00
all_subsequences.py Pyupgrade to Python 3.9 (#4718) 2021-09-07 13:37:03 +02:00
coloring.py Fix comments in backtracking/coloring.py (#4857) 2021-10-01 23:48:47 +02:00
combination_sum.py Upgrade to Python 3.12 (#9576) 2023-10-03 14:47:10 +05:30
hamiltonian_cycle.py [pre-commit.ci] pre-commit autoupdate (#9013) 2023-08-29 15:18:10 +02:00
knight_tour.py Add more ruff rules (#8767) 2023-05-26 09:34:17 +02:00
minimax.py Pyupgrade to Python 3.9 (#4718) 2021-09-07 13:37:03 +02:00
n_queens_math.py Make some ruff fixes (#8154) 2023-03-01 17:23:33 +01:00
n_queens.py Add pep8-naming to pre-commit hooks and fixes incorrect naming conventions (#7062) 2022-10-13 00:54:20 +02:00
power_sum.py Add power sum problem (#8832) 2023-06-26 09:39:18 +02:00
rat_in_maze.py clean of unnecessary checks, imports, calls (#7993) 2022-11-21 00:00:27 +13:00
README.md Add README files 1/7 (#5754) 2021-11-04 18:49:36 +08:00
sudoku.py [pre-commit.ci] pre-commit autoupdate (#9013) 2023-08-29 15:18:10 +02:00
sum_of_subsets.py Make some ruff fixes (#8154) 2023-03-01 17:23:33 +01:00
word_search.py Reduce the complexity of backtracking/word_search.py (#8166) 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.