mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-04-29 00:53:36 +00:00
Code Issues Packages Projects Releases Wiki Activity
4a5246786a
Python/backtracking
History
Siddhant 787aa5d3b5
doctest all_combinations.py () 
* doctest in all_combinations.py

* added doctest in all_combinations.py

* doctests in all_combinations.py

* add doctest all_combinations.py

* add

---------

Co-authored-by: Siddhant Jain <sjain35@buffalo.edu>
2025-01-12 17:54:23 -08:00
..
__init__.py
Add __init__.py files in all the directories ()
2020-09-28 19:42:36 +02:00
all_combinations.py
doctest all_combinations.py ()
2025-01-12 17:54:23 -08:00
all_permutations.py
Fixes ()
2024-06-02 20:00:26 -07:00
all_subsequences.py
Fixes ()
2024-06-02 20:00:26 -07:00
coloring.py
[pre-commit.ci] pre-commit autoupdate ()
2024-03-13 07:52:41 +01:00
combination_sum.py
Upgrade to Python 3.12 ()
2023-10-03 14:47:10 +05:30
crossword_puzzle_solver.py
Enable ruff PLR5501 rule ()
2024-03-28 18:25:41 +01:00
generate_parentheses.py
Generate parentheses ()
2023-10-29 13:55:31 +01:00
hamiltonian_cycle.py
[pre-commit.ci] pre-commit autoupdate ()
2024-03-13 07:52:41 +01:00
knight_tour.py
[pre-commit.ci] pre-commit autoupdate ()
2024-07-02 07:02:29 +02:00
match_word_pattern.py
Match a pattern and String using backtracking ()
2023-10-06 11:45:10 +13:00
minimax.py
[pre-commit.ci] pre-commit autoupdate ()
2024-03-13 07:52:41 +01:00
n_queens_math.py
[pre-commit.ci] pre-commit autoupdate ()
2024-03-13 07:52:41 +01:00
n_queens.py
[pre-commit.ci] pre-commit autoupdate ()
2024-03-13 07:52:41 +01:00
power_sum.py
Updated test cases of power_sum.py ()
2023-10-14 04:31:43 -04:00
rat_in_maze.py
UPDATED rat_in_maze.py ()
2023-10-04 20:43:17 +02:00
README.md
Add README files 1/7 ()
2021-11-04 18:49:36 +08:00
sudoku.py
Enable ruff RUF002 rule ()
2024-04-22 21:51:47 +02:00
sum_of_subsets.py
[pre-commit.ci] pre-commit autoupdate ()
2024-03-13 07:52:41 +01:00
word_break.py
Add Word Break algorithm ()
2024-10-02 17:03:48 -07:00
word_ladder.py
Add word ladder algorithm in backtracking ()
2024-10-01 19:48:17 -07:00
word_search.py
backtracking -> word_search - replacing the example in doctest ()
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.