搜索资源列表
chinesechess
- 本人机对弈程序采用了多种搜索算法.以下是本程序主要的类说明: 1.CEveluation类:估值类,对给定的棋盘进行估值. 2.CMoveGenerator类:走法产生器,对给定的棋盘局面搜索出所有可能的走法. 3.CSearchEngine类:搜索引擎基类. 4.CNegaMaxEngine类:负极大值法搜索引擎. 5.CAlphaBetaEngine类:采用了Alpha-Beta剪枝技术的搜索引擎. 6.CFAlphaBetaEngine类:
TASKS
- 限界剪枝法语回溯法类似，是一种在问题的状态空间树中搜索解的算法。优先级用优先队列来实现，优先级高即估计函数值越低的结点越靠近队列开头位置。-French back-Bound pruning method similar to the problem is a state-space search tree algorithm solution. Priority queue with priority to the realization of the high priority that i
BranchAndBound
- 本程序是用分支定界法求最短路径的程序，用C++编写。采取的基本思想是：使用最小优先队列分支界限法来构建程序，细节是对于每个节点，包含三个变量：当前走过的路径长度、当前的花费和该节点对应的实际城市的编号。关于确定节点优先级，我们规定首先以“当前走过的路径长度”来确定优先级，当路径长度相等时，以“当前的花费”来确定优先级。同时，我们还定义两个数组dist[i]和pric[i]保存当前求得的从源城市到每个城市的最短距离和花费，用于剪枝时的评判标准。-This procedure is to use b
Pruning-the-Volterra-series-for
- 基于物理知识的volterra 级数的一种简化方法-Pruning the Volterra series for behavioral modeling of power amplifiers using physical knowledge
Knight_Tour
- 这是一个关于马周游的问题。主要采用回溯方法，加入了优化的剪枝。-This traverse a horse. Backtracking method, join optimization pruning.
bookmis-build-desktop
- 用QT结合SQLite做的简单的图书馆管理系统，能够实现书籍的查询、添加、删改等操作，同时对管理员也有添加管理员、修改密码等功能-SQLite do simple library management system, combined with QT books query, add, pruning and other operations administrator also add an administrator to modify the password functions
VSCCP
- 这是由越南人开发的简单中国象棋程序,其中用到了alpha beta剪枝算法-This is developed by the Vietnamese simple Chinese chess program, which USES alpha beta pruning algorithm
zijiheshuwenti
- 1、问题陈述 给定N个数，和一个数T，判定是否可以从N个数中取出若干个数，使它们的和等于T。输出：YES或者NO。把N个数看成一个集合，问题就是从这个集合中选出一个子集，使这个子集满足和是T 2、问题分析： 枚举+剪枝。 -1, the problem statement given number N, and a number T, determining whether the number N is removed from certain numbers, so tha
BinaryTree
- 二叉树类的全部实现：建树、清空、判空、找根节点、找父节点、找子节点、剪枝、前序遍历、中序遍历、后序遍历和层次遍历、判断是否为完全二叉树。-All binary tree class: achievements, empty, empty sentence, find the root node, find the parent node, find the child nodes, pruning, preorder, preorder, postorder traversal and leve
1085(Triangle-War)
- poj1085，博弈论的典型最大最小搜索和剪枝-poj1085, game theory typical minimum and maximum search and pruning
Aprio
- APRIO数据挖掘算法，实现了剪枝等功能，可直接使用,标准的C++写法，利于后续改编-APRIO data mining algorithm, pruning and other functions, can be used directly, the wording of the standard C++, which will help the subsequent adaptation
Random-Forest-Matlab-master
- This toolbox was written for my own education and to give me a chance to explore the models a bit. It is NOT intended for any serious applications and it does not NOT do many of things you would want a mature implementation to do, like leaf pruni
Data-structure-(c)-
- 讲述了数据结构中的搜索：深搜，广搜，剪枝，IDA算法，并且包含各类例题。-About the data structure search: search deep, wide search, pruning, IDA algorithm, and contains all kinds of examples.
shudu
- 数独代码，不带图形界面，运用了一些剪枝方法，牺牲空间来换取时间，比暴力解法速度快很多-Sudoku code without a graphical interface, use some pruning methods to sacrifice space for time, much faster than the rate of violence Solution
Tic-Tac-Toe-
- 井字过三关游戏。人机对战。用了暴力枚举及a、B剪枝。-Tic tac toe game. Man machine to war. With violence and a, B pruning enumeration.
chess
- 单人下五子棋,剪枝算法实现计算机下棋,没有图形界面，比较简单，适合初学者学习-Under single backgammon, chess computers pruning algorithm, no graphical interface, relatively simple, suitable for beginners to learn
regression-tree
- 此源码是机器学习中回归树的源码，包括建立、训练、剪枝等等，可供新手参考-This source is the source of the return tree in machine learning, including the establishment, training, pruning, etc., for the novice reference
branch_and_bound
- 只是实现了分之定界，运行速度慢，剪枝部分。(Just to achieve the sub boundary, slow running, pruning part)
奇偶剪枝
- 自己整理的关于奇偶剪枝的资料，在DFS或者BFS都非常有用(The data that you have arranged about the odd and even pruning is very useful in DFS or BFS)
一字棋
- java实现极大极小算法和 -剪枝实现一字棋(Java implementation of minimax algorithm and pruning realization of a word chess)