Logo
Explore Help
Sign In
Mirror/Python
Watch 1
Star 0
Fork 0
Code Issues Packages Projects Releases Wiki Activity
Files
a73f37b2ecf29aeee1b0417ac53016f5ad0fbeee
Python/backtracking
T
History
…
..
__init__.py
…
all_combinations.py
…
all_permutations.py
…
all_subsequences.py
…
coloring.py
…
combination_sum.py
…
crossword_puzzle_solver.py
…
generate_parentheses.py
Generate parentheses (#10903)
2023-10-29 13:55:31 +01:00
hamiltonian_cycle.py
…
knight_tour.py
…
match_word_pattern.py
…
minimax.py
…
n_queens_math.py
…
n_queens.py
…
power_sum.py
Updated test cases of power_sum.py (#9978)
2023-10-14 04:31:43 -04:00
rat_in_maze.py
…
README.md
…
sudoku.py
…
sum_of_subsets.py
Make some ruff fixes (#8154)
2023-03-01 17:23:33 +01:00
word_search.py
…

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.

  • https://en.wikipedia.org/wiki/Backtracking
  • https://en.wikipedia.org/wiki/Decision_tree_pruning
  • https://medium.com/@priyankmistry1999/backtracking-sudoku-6e4439e4825c
  • https://www.geeksforgeeks.org/sudoku-backtracking-7/
Reference in New Issue View Git Blame Copy Permalink
Powered by Gitea Version: 1.27.2 Page: 2491ms Template: 110ms
GitHub Default Auto
English
Bahasa Indonesia Deutsch English Español Français Gaeilge Italiano Latviešu Magyar nyelv Nederlands Polski Português de Portugal Português do Brasil Suomi Svenska Türkçe Čeština Ελληνικά Български Русский Українська فارسی മലയാളം 日本語 简体中文 繁體中文(台灣) 繁體中文(香港) 한국어
Licenses API