mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2024-11-23 21:11:08 +00:00
Code Issues Packages Projects Releases Wiki Activity
0b2c9fb6f1
Python/backtracking
History
Kamil 7b996e2c22
backtracking -> word_search - replacing the example in doctest (#10188) 
* Replacing the generator with numpy vector operations from lu_decomposition.

* Revert "Replacing the generator with numpy vector operations from lu_decomposition."

This reverts commit ad217c6616.

* Replacing the example in doctest with a less resource-intensive example.
2023-10-10 00:16:02 -04:00
..
__init__.py
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
combination_sum.py Upgrade to Python 3.12 (#9576) 2023-10-03 14:47:10 +05:30
hamiltonian_cycle.py
knight_tour.py Add more ruff rules (#8767) 2023-05-26 09:34:17 +02:00
match_word_pattern.py
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
power_sum.py
rat_in_maze.py UPDATED rat_in_maze.py (#9148) 2023-10-04 20:43:17 +02: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
word_search.py backtracking -> word_search - replacing the example in doctest (#10188) 2023-10-10 00:16:02 -04:00

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.