用python实现回溯算法适用于课程设计所有组合所有排列所有子序列着色等问题

共17个文件

py：16个

md：1个

python

课程设计

需积分: 0 5 下载量 24 浏览量 2023-05-19 01:50:03 上传评论收藏 17KB ZIP 举报

温馨提示

python实现基本算法所有组合所有排列所有子序列染色组合总和哈密顿循环骑士之旅极小极大最小最大 N皇后区 N皇后区数学老鼠迷宫数独子集之和词搜索 All Combinations All Permutations All Subsequences Coloring Combination Sum Hamiltonian Cycle Knight Tour Minimax Minmax N Queens N Queens Math Rat In Maze Sudoku Sum Of Subsets Word Search

资源推荐

资源详情

资源评论

收起资源包目录

backtracking.zip （17个子文件）

backtracking

__init__.py 0B

sum_of_subsets.py 2KB

minimax.py 2KB

all_combinations.py 1KB

all_permutations.py 1KB

coloring.py 3KB

minmax.py 2KB

rat_in_maze.py 3KB

hamiltonian_cycle.py 6KB

sudoku.py 4KB

combination_sum.py 2KB

word_search.py 5KB

n_queens_math.py 5KB

README.md 374B

knight_tour.py 2KB

all_subsequences.py 1KB

n_queens.py 3KB

共 17 条

# 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/>

评论收藏

内容反馈