搜索资源列表
java1soduku
- java用于解决数独问题，这是一个设置一个矩阵的方法，当然核心依然是穷举。
javaamb
- java解决数独问题，这个程序用的是amb。可以一看，但是核心依然是穷举
TSP
- 用穷举法和模拟退火方法实现了求解tsp问题-With exhaustion and simulated annealing method for solving TSP problem
ban-zhuan
- 用穷举法解决以下问题：36块砖，36人搬，男搬4，女搬3，两个小孩抬1砖。要求一次全搬完，问男、女、小孩有多少？-The brute-force method to solve the following problem: 36 bricks, 36 people move, the men moved 4 female moved two children lift a brick. Require full-time to move those, ask men and women, how
J_Grid15
- 运用穷举法求解1-9，3*3数独问题，即使每行每列及对角线上的之和为15，算法简单，但运算时间有点长，大概是五分钟左右，请耐心等待。-Using exhaustive method to solve 1-9, 3*3 Sudoku problem, even if each row and each column and on the diagonal and 15, simple algorithm, but the operation time is long, about five min
EightQueens
- 一个用来研究八皇后问题的java小程序，采用递归算法遍历树来穷举所有符合要求的排列，存储后用图形界面表示出来。-Used to study a problem of the eight Queen of java applets, using recursive tree traversal algorithm to exhaustive array of all meet the requirements, storage, said later a graphical interface.