algorithm/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-07-24 08:42:41 +08:00
Code Issues Packages Projects Releases Wiki Activity
Files
Python/backtracking
History
Pedram_Mohajer b860003576 Add doctest to is_safe function (#11183)
2023-11-27 18:43:51 +01:00
..
__init__.py
Add __init__.py files in all the directories (#2503)
2020-09-28 19:42:36 +02:00
all_combinations.py
Bug fix combinations (#11158)
2023-11-25 14:31:17 +01: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
crossword_puzzle_solver.py
Create crossword_puzzle_solver.py (#11011)
2023-10-28 23:13:14 +02:00
generate_parentheses.py
Generate parentheses (#10903)
2023-10-29 13:55:31 +01:00
hamiltonian_cycle.py
[pre-commit.ci] pre-commit autoupdate (#9013)
2023-08-29 15:18:10 +02:00
knight_tour.py
Fix typo in knight_tour.py (#11173)
2023-11-25 12:17:59 +01:00
match_word_pattern.py
Match a pattern and String using backtracking (#9861)
2023-10-06 11:45:10 +13:00
minimax.py
Enhance readability of Minimax (#10838)
2023-10-23 13:42:02 -04:00
n_queens_math.py
Make some ruff fixes (#8154)
2023-03-01 17:23:33 +01:00
n_queens.py
Add doctest to is_safe function (#11183)
2023-11-27 18:43:51 +01:00
power_sum.py
Updated test cases of power_sum.py (#9978)
2023-10-14 04:31:43 -04:00
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
Make some ruff fixes (#8154)
2023-03-01 17:23:33 +01:00
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.