Files

T

54e2aa67e8 Enhance readability of Minimax (#10838 )

* Enhance readability of Minimax

* [pre-commit.ci] auto fixes from pre-commit.com hooks

for more information, see https://pre-commit.ci

* Reduce line overflow

* Update backtracking/minimax.py

Co-authored-by: Tianyi Zheng <tianyizheng02@gmail.com>

* Update backtracking/minimax.py

Co-authored-by: Tianyi Zheng <tianyizheng02@gmail.com>

* Update backtracking/minimax.py

Co-authored-by: Tianyi Zheng <tianyizheng02@gmail.com>

* Remove line overflow

---------

Co-authored-by: pre-commit-ci[bot] <66853113+pre-commit-ci[bot]@users.noreply.github.com>
Co-authored-by: Tianyi Zheng <tianyizheng02@gmail.com>

2023-10-23 13:42:02 -04:00

__init__.py

…

all_combinations.py

Test cases for all_combinations (#10633 )

2023-10-17 16:57:33 +02:00

all_permutations.py

…

all_subsequences.py

…

coloring.py

…

combination_sum.py

…

hamiltonian_cycle.py

…

knight_tour.py

…

match_word_pattern.py

…

minimax.py

Enhance readability of Minimax (#10838 )

2023-10-23 13:42:02 -04:00

n_queens_math.py

…

n_queens.py

Enhance readability of N Queens (#9265 )

2023-10-22 14:51:56 -04:00

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

…

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.