Home|About|Gaming cabinet|Archives|How it works|Starter sites

GeezerVison is showing github.com — PythonAlgorithms-/backtracking at master · martenc/PythonAlgorithms-

Expand file tree

/

backtracking

/

Copy path

Directory actions

More options

More options

Directory actions

More options

More options

Latest commit

History

History

/

backtracking

/

Copy path

Folders and files

Name		Name	Last commit message	Last commit date
parent directory ..
README.md		README.md
__init__.py		__init__.py
all_combinations.py		all_combinations.py
all_permutations.py		all_permutations.py
all_subsequences.py		all_subsequences.py
coloring.py		coloring.py
combination_sum.py		combination_sum.py
crossword_puzzle_solver.py		crossword_puzzle_solver.py
generate_parentheses.py		generate_parentheses.py
hamiltonian_cycle.py		hamiltonian_cycle.py
knight_tour.py		knight_tour.py
match_word_pattern.py		match_word_pattern.py
minimax.py		minimax.py
n_queens.py		n_queens.py
n_queens_math.py		n_queens_math.py
power_sum.py		power_sum.py
rat_in_maze.py		rat_in_maze.py
sudoku.py		sudoku.py
sum_of_subsets.py		sum_of_subsets.py
word_break.py		word_break.py
word_ladder.py		word_ladder.py
word_search.py		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.