Namespace gopy.backtracking
Sub-modules
gopy.backtracking.all_combinations-
In this problem, we want to determine all possible combinations of k numbers out of 1 … n. We use backtracking to solve this problem. Time …
gopy.backtracking.all_permutations-
In this problem, we want to determine all possible permutations of the given sequence. We use backtracking to solve this problem …
gopy.backtracking.all_subsequences-
In this problem, we want to determine all possible subsequences of the given sequence. We use backtracking to solve this problem …
gopy.backtracking.minimaxgopy.backtracking.n_queens-
The nqueens problem is of placing N queens on a N * N chess board such that no queen can attack any other queens placed on that chess board. This …
gopy.backtracking.sudoku-
Given a partially filled 9×9 2D array, the objective is to fill a 9×9 square grid with digits numbered 1 to 9, so that every row, column, and and each …
gopy.backtracking.sum_of_subsets-
The sum-of-subsetsproblem states that a set of non-negative integers, and a value M, determine all possible subsets of the given set whose summation …