Location:
Search - minimax
Search list
Description: 中国象棋人机版,其中采用了多种搜索方法,有最基本的极大极小值方法和Alpha-Beta方法,还有历史启发,渴望搜索,PVS等搜索方法-Chinese version of man-machine chess, which used a variety of search methods, the most basic minimax value method and Alpha-Beta, history also inspired desire to search, and other search methods PVS
Platform: |
Size: 123945 |
Author: 哈哈哈 |
Hits:
Description: 和電腦對戰的井字遊戲,實做了人工智慧的極大極小演算法(Minimax),使用BCB6開發-computer screen and the gridwork games, done a great small artificial intelligence algorithms (Minimax), the use of development BCB6
Platform: |
Size: 824924 |
Author: 李慣頭 |
Hits:
Description: 人工智能极大极小搜索，实现了井字棋的智能博弈程序。-Minimax artificial intelligence search and realized the groined smart game of chess procedures.
Platform: |
Size: 19064 |
Author: sunshine |
Hits:
Description: 人工智能，用极大极小剪枝算法实现的黑白棋游戏。-artificial intelligence, with Minimax pruning algorithm of the game reversi.
Platform: |
Size: 11582 |
Author: 覃丽萍 |
Hits:
Description: 和電腦對戰的井字遊戲,實做了人工智慧的極大極小演算法(Minimax),使用BCB6開發-computer screen and the gridwork games, done a great small artificial intelligence algorithms (Minimax), the use of development BCB6
Platform: |
Size: 824320 |
Author: 李慣頭 |
Hits:
Description: 人工智能极大极小搜索，实现了井字棋的智能博弈程序。-Minimax artificial intelligence search and realized the groined smart game of chess procedures.
Platform: |
Size: 18432 |
Author: sunshine |
Hits:
Description: 人工智能，用极大极小剪枝算法实现的黑白棋游戏。-artificial intelligence, with Minimax pruning algorithm of the game reversi.
Platform: |
Size: 11264 |
Author: 覃丽萍 |
Hits:
Description: Tree-Structured Programs:Look-Ahead in Games----The MiniMax Method-Tree-Structured Programs : Look-Ahead in Games---- The MiniMax Method
Platform: |
Size: 2048 |
Author: David |
Hits:
Description: HILBERT-HUANG TANSFORM 进行曲线拟和时求信号极大极小值的两种方法-SYSTEMS-CSF TANSFORM for curve fitting and time for signal minimax Two methods
Platform: |
Size: 1024 |
Author: weixiangzhuan |
Hits:
Description: 人工智能课上的要我们编写的一字棋，理由极大极小法编写的-Artificial Intelligence class to the word game we prepared the ground prepared by minimax method
Platform: |
Size: 1579008 |
Author: Decell Hoo |
Hits:
Description: 运用人工智能的极小极大博弈算法解决一字棋，又名井子棋-Minimal use of artificial intelligence algorithms to solve the word great chess game, chess, also known as sub-wells
Platform: |
Size: 3072 |
Author: 彬 |
Hits:
Description: 完成了α-β剪枝的功能，从文件中读入每个结点的极大极小值以及各个父子结点的关系，然后进行剪枝，输出被剪枝结点的信息-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 node pruning information
Platform: |
Size: 14336 |
Author: 郑益夫 |
Hits:
Description: 用极大极小算法编写的井字棋游戏
开发语言是Visual Prolog-Minimax algorithm used to prepare the game of tic-tac-toe game development language is Visual Prolog
Platform: |
Size: 2048 |
Author: zhangqian |
Hits:
Description: 采用极大极小剪枝的博弈算法实现的五子棋游戏,可以工机对弈.人人对弈。-The use of minimax pruning algorithm of the game Gobang games, game machines can work. All game.
Platform: |
Size: 483328 |
Author: zhouprogram |
Hits:
Description: This the famous connect4 game implemented using the MiniMax algorithm and allows the user to select their opponent level.-This is the famous connect4 game implemented using the MiniMax algorithm and allows the user to select their opponent level.
Platform: |
Size: 221184 |
Author: saurako |
Hits:
Description: This is a game namely "Tic-Tac-Toe" written in Java Language. The minimax algorithm had used.
Platform: |
Size: 23552 |
Author: Titanium |
Hits:
Description: Instrukcja serwisowa minimax plus termet -Instrukcja serwisowa minimax plus termet
Platform: |
Size: 1014784 |
Author: danus |
Hits:
Description: This program implement minimax algorithm for caro game for two players, O and X, who take
turns marking the spaces in a n*n grid, assuming that O goes first. The player who succeeds in placing
five respective marks in a consecutive horizontal, vertical or diagonal row wins the game. Suppose O is
the minimizing player and X is the maximizing player. -This program implement minimax algorithm for caro game for two players, O and X, who take
turns marking the spaces in a n*n grid, assuming that O goes first. The player who succeeds in placing
five respective marks in a consecutive horizontal, vertical or diagonal row wins the game. Suppose O is
the minimizing player and X is the maximizing player.
Platform: |
Size: 2048 |
Author: long |
Hits:
Description: 极大极小化算法常用在博弈中，可以动态的选定参数，也可用于活动轮廓模型中参数的设定-Minimax algorithm isused in the game, you can dynamically selected parameter and active contour model can also be used to set the parameters
Platform: |
Size: 677888 |
Author: 蓝本 |
Hits:
Description: A simple implementation in C language of the Minimax algorithm.
/!\ Code is commented in french.
Platform: |
Size: 1024 |
Author: LoveMetal |
Hits: