搜索资源列表
maxmin1
- HILBERT-HUANG TANSFORM 进行曲线拟和时求信号极大极小值的两种方法-SYSTEMS-CSF TANSFORM for curve fitting and time for signal minimax Two methods
cchess_ai
- 一个象棋AI的源代码,带游戏界面,其中可选择多种AI引擎,从最基础的深度跌代极大极小值搜索到使用开局库,历史启发的极小窗搜索,具有很高的学习研究价值.-a chess AI source code, with the game interface, which can choose a variety of AI engines, from the most basic of depth or substituting minimax search to start using the hist
fivechess
- 实现人机对弈，主要采用博弈树技术。在选取最优的走步时使用极大极小分析法
Max-IntMax-MinMin-Min
- 极小 算法（Min-Min）、极大极小算法(Max-Min)、最大时间跨度算法（Max-Int）三种典型的映射算法的算法原理以及计算程序
integralmean
- 信号分析里常用，求局部极大极小值的位置！用积分平均的方法！-Commonly used in signal analysis, seeking the position of the local minimax value! Integral average method!
PCgame
- 一个人工智能下象棋的小游戏 含电子书 包含了alph-beta 深度优先 极大极小值算法-Under the artificial intelligence of a chess game with e-book contains alph-beta depth-first minimax algorithm
abcut
- 完成了α-β剪枝的功能，从文件中读入每个结点的极大极小值以及各个父子结点的关系，然后进行剪枝，输出被剪枝结点的信息-Completion of the α-β pruning function, read from the file of each node as well as the minimax value of each node of the relationship between father and son, and then proceed to cut output by
BrentOptimize
- 实现Brent(布伦特)优化搜索，寻找极大极小值。.M文件-brent optimize to search for the max or min data.
LargeSealeSParseMinimaxProblems
- 数学物理反演中的大型稀疏极大极小问题的数值计算方法-Numerieal Methods for Large Seale SParse Minimax Problems
Relation
- 关系运算，内有关系性质的判断，是否自反，传递，对称。寻找最大最小，极大极小元素。还包括一个自己写的set类。-Relational operators, the judgment of the nature of the relationship is reflexive, transfer, symmetry. Find the maximum and minimum, maximum and minimum elements. Also includes a set class to wri
Aphda
- 中国象棋的搜索算法,对象棋的棋子进行简单的搜索，包含了极大极小值、走法栈、局面保存、以获取最佳走法-Chinese Chess
GoBang
- 采用c#编程的人机对战的五子棋程序，AI智能采用贪心算法和极大极小值算法，程序有详尽的注释，适合参考-Man-machine war backgammon program using c# programming, AI smart greedy algorithm and minimax algorithm, the program detailed notes for reference
train_fmmnn
- 模糊极大极小神经网络，新型神经网络用于分类.-fuzzy min-max neural network
Line-Chess(done)
- 简单的一字棋（也称#字棋）人机对战，利用极大极小方法及阿尔法贝塔剪枝策略。-Simple word game (also known as the# chess) man-machine war, the use of minimax alpha beta pruning methods and strategies.
GA
- 基于遗传算法的函数极值求解，就是通过遗传算法求解函数极大极小值-use the GA algorithm to get the min or max vaual of the function
JZQ
- 利用极大极小值搜索算法实现井字棋游戏，包含一些优化算法过程-Use Minimax search algorithm Tic-tac-toe game, including some optimization process
tictactoe
- 人工智能的一字棋游戏，VC++单文档应用程序，使用博弈树的极大极小过程和α-β剪枝算法。-It is a line game, it is a single docment application program, use the max-min and α-β pruning algorithm.
Chess
- 实现了象棋小游戏，基于极大极小搜索，用到了剪枝优化-Achieved a chess game, based on a minimal minimal search, using pruning optimization
multiagent1
- pacman project2 multiagent，简单的对抗搜索，实现简单反射算法，极大极小值算法和Alpha-beta算法。(pacman project2 multiagent)
chess
- 利用极大极小算法及 a-b 剪枝策略实现3X3一字棋下棋程序，人工智能课本上的算法实现(This is a simple chess program that use Minimax algorithm and AB Prune strategy .)