Description: 这是在Jcreator下用java语言编写的八皇后问题,采用递归回溯解决,在控制台打印输出92个解-This is at Jcreator using java language eight Queen' s problem using recursive backtracking resolved, at the console printout 92 Solutions Platform: |
Size: 1024 |
Author:方程 |
Hits:
Description: 0/1背包问题的几种解法,包括回溯法、动态规划法以及穷举法。另外还包括集中方法的一个测试报告。-0/1 knapsack problem several solutions, including backtracking, dynamic programming method and the exhaustive method. It also includes a focus on methods of test reports. Platform: |
Size: 157696 |
Author:王若 |
Hits:
Description: 人工智能,回溯方法解MC问题,java语言。主要算法在MC.java中,test.java是测试程序,运行test.java程序即可。-Artificial intelligence, backtracking method to solve the MC problem, java language. MC.java in the main algorithm, test.java is a test program, run test.java procedures. Platform: |
Size: 1024 |
Author:wqs07 |
Hits:
Description: 用回溯法解决不是很麻烦的传教士和野人问题-By backtracking to solve is not very troublesome issue of missionaries and Savage Platform: |
Size: 2048 |
Author:Pudding |
Hits:
Description: 这是一个关于八皇后问题用回溯法求解的java解法!-This is the one on the eight queens problem using backtracking method for solving the java solution! Platform: |
Size: 1024 |
Author:窗外寒星 |
Hits:
Description: example of candy problem, solved in java using backtracking algorithm and keeping saved solutions Platform: |
Size: 3072 |
Author:ploper |
Hits:
Description: 老师给的用Java编写的算法,包括背包问题,
回溯法等等,适合有基础的学习。-Teacher' s use of algorithms written in Java, including the knapsack problem, backtracking, etc., suitable for basic learning. Platform: |
Size: 1267712 |
Author:小黑 |
Hits:
Description: This a java base maze travailing algorithm, backtracking based. Recursively travels trough the maze and find the target in the maze. -This is a java base maze travailing algorithm, backtracking based. Recursively travels trough the maze and find the target in the maze. Platform: |
Size: 1024 |
Author:dilanga |
Hits:
Description: 用java语言,基于回溯法实现N皇后的位置放置方案,程序可以通过参数来设置要解决几个皇后的放置,默认是4个。(Using java language, backtracking method is used to implement the placement plan of N queens. The program can be set by parameters to solve the placement of several queens, and the default is 4.) Platform: |
Size: 1024 |
Author:阿飞3536 |
Hits:
Description: 回溯法求解最大团问题,时间复杂度为O(n*2^n)。(The backtracking method is used to solve the maximum clique problem with a time complexity of O (n*2^n).) Platform: |
Size: 1024 |
Author:dupeihui |
Hits: