搜索资源列表
ts3
- C:\\Documents and Settings\\徐鸣\\桌面\\minimax&pso\\software-C : \\ Documents and Settings \\ Ming Xu \\ Desktop \\ minimax
tic-tac-toe
- 一个简单的用二叉树实现的极大极小指算法人工智能井字棋游戏，使用C++的类，和STL模版库中的vector-A simple binary tree the minimax means algorithm artificial intelligence tic-tac-toe game of chess the class of C++, and STL template library in the vector
onechess
- 人工智能课上的要我们编写的一字棋，理由极大极小法编写的-Artificial Intelligence class to the word game we prepared the ground prepared by minimax method
Ex_BOYIDESIGN
- 用VC实现的，采用C++语言、极大极小算法完成的三字棋小游戏。是人工智能的一次作业，可以运行。-VC with the implementation, using C++ language, minimax algorithm to complete chess game of words. Artificial intelligence are the one-stop, you can run.
73462707wuziqi
- 在本次“五子棋“程序的编写中，只编写了人机对弈部分，运用了博弈树进行搜索，在选取最优的走步时使用极大极小分析法，考虑到搜索的时间复杂度和空间复杂度，在程序中只进行了2步搜索，即计算机在考虑下一步的走法时，只对玩家进行一步的推测。（程序中的棋盘规格为15*15）-During the meeting, " Gobang" the preparation of procedures, only part of the preparation of the human-compute
BreakthroughGame_C_Code
- An implementation of the Breakthrough board game. The application uses the minimax function to enhance its evaluation function.
code
- 以一字棋游戏为例，设计的一个3行3列的棋盘，自己给出估价函数，采用极大极小搜索方法。-To the word chess game, for example, the design of a 3 by 3 chessboard, given their valuation functions, minimax search method.
tictactoe
- tictactoe with MiniMax algorithm
TicTacToe
- TicTacToe MiniMax Theorem In C-TicTacToe MiniMax Theorem In C++
Tic-tac-toe-chess
- C语言实现井字棋博弈的过程，采用极大极小算法。-The C language game of tic-tac-toe chess, using the minimax algorithm.
Cabcutto
- 完成了α-β剪枝的功能，从文件中读入每个结点的极大极小值和各个父子结点的关系，然后进行剪枝，输出被剪枝结点的信息-Α-β pruning, each node reads from the file minimax and various parent-child node, and then pruning output pruning node information
An_Advance199150522006
- This a complete Tictactoe game, it includes many functionalities, you can play games against another human, you can play against the computer, you can also even let the computer play against itself. The A.I is very good, actualy it is unbeatable
sga
- 遗传算法求函数极大极小值，可用于简单的最优控制-Genetic algorithms function Minimax, optimal control for simple
11
- 永远不输的后手算法。在此任务中，对手会采取使自己优势最大化的策略。所以采取极小化极大的方法。利用递归的方法，试探作为后手的每一种走法的情况，若其中一种走法存在可能会输的情况， 则放弃该种走法，直到找到一种一定不输的走法。 -Never lose FLAC algorithms. In this task, the opponent will take advantage of to make their maximization strategy. So take the minimax
TFS14-Deng
- MATLAB CODE FOR: Minimax Probability TSK Fuzzy System Classifier: A More Transparent and Highly Interpretable Classification Model
acm1942
- 浙江大学的acm1942，极小极大路径的问题，较简单-Zhejiang University acm1942, problem minimax path is relatively simple
一字棋
- java实现极大极小算法和 -剪枝实现一字棋(Java implementation of minimax algorithm and pruning realization of a word chess)
一齐天下
- 采用极大极小算法的苏拉卡尔塔棋C语言编程(Sura C programming language using minimax algorithm)