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: This is a game namely "Tic-Tac-Toe" written in Java Language. The minimax algorithm had used. Platform: |
Size: 23552 |
Author:Titanium |
Hits:
Description: C语言实现井字棋博弈的过程，采用极大极小算法。-The C language game of tic-tac-toe chess, using the minimax algorithm. Platform: |
Size: 312320 |
Author:长空 |
Hits:
Description: 一个简单的用二叉树实现的极大极小指算法人工智能井字棋游戏，使用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 Platform: |
Size: 1038336 |
Author:laixin |
Hits:
Description: Tic-tac-toe游戏搜索引擎，带有特定深度的minimax tree，并且自带有一个可以在非叶结点处进行评估的评估函数-Tic-tac-toe game search engine, with particular depth minimax tree, and comes with an assessment of the non-leaf nodes at the evaluation function Platform: |
Size: 3072 |
Author:haha |
Hits:
Description: Write a Java program that can play tic-tac-toe based on the minimax
algorithm.-Write a Java program that can play tic-tac-toe based on the minimax
algorithm. Platform: |
Size: 2048 |
Author:zhangzhanglin |
Hits:
Description: This a simple VB console based TicTacToe program. I do have parts of the code commented out that are the building blocks of a minimax based ai computer player. I have yet to get the AI working but I wanted to be able to view some of the code on here to get some idea so I am uploading what I have done thus far. In an effort to prove to my professor that I did this myself and didn t copy the concept the internet, I chose a fairly complicated procedure for the tic tac toe game. I have only been programming for 1 month so please forgive the poor quality programming. -This is a simple VB console based TicTacToe program. I do have parts of the code commented out that are the building blocks of a minimax based ai computer player. I have yet to get the AI working but I wanted to be able to view some of the code on here to get some idea so I am uploading what I have done thus far. In an effort to prove to my professor that I did this myself and didn t copy the concept the internet, I chose a fairly complicated procedure for the tic tac toe game. I have only been programming for 1 month so please forgive the poor quality programming. Platform: |
Size: 5120 |
Author:fezline |
Hits:
Description: 井字棋人机对弈，实现基本的人机交互界面，采用图形化界面显示棋盘和棋子。电脑能根据人下的棋，判断下一步较优的走法。井字棋实现人机对弈，为了实现智能化，要为每一步棋估值，采用极大极小值算法，负极大值算法，alphabeta等算法得出较优的下一步棋。平时一个人也可以下棋自娱自乐了。
井字棋人机对弈为我一个人一组完成。
-Tic-tac-toe man-machine chess, to achieve the basic man-machine interface, graphical interface display board and pieces. According to computer chess people under the next judge on better moves. Tic-tac-toe realize man-machine chess, in order to achieve intelligent, To every move valuations using Minimax algorithm, negative maximum value algorithm, alphabeta on better algorithms derived next move. Usually a person can also play chess entertain. Tic-tac-toe for me a man-machine chess groups of completion. Platform: |
Size: 18432 |
Author:赵安 |
Hits:
Description: 游戏树在人工智能的应用相当重要，若要寻找某赛局中最佳的步法的一个方式，是利用极小化极大算法在游戏树中搜寻最佳解，例如在井字游戏中电脑可以很快速地找到最佳解并做出决策。-Application of artificial intelligence in the game tree is very important, to find an innings in a manner best step is to use Minimax in the game tree search for the optimal solution, such as computer games Tic Tac Toe you can quickly find the best solution and make decisions. Platform: |
Size: 6144 |
Author:Bao |
Hits:
Description: 井字棋 α-β剪枝算法
在简单的游戏中，能够从当前游戏状态出发，搜索游戏的博弈树并确定最优行动方案的算法是存在的。其中最有名的算法就是极小极大算法。对于简单的双人游戏，极小极大算法很有用。它是在轮流行动的游戏中选择最好的行动的一种方法。
在博弈树中的每一个结点（一个结点表示一个可能的行动方案）都可以保存一个值，该值用来定义对应行动在帮助玩家获胜方面的优良程度。因此，对于一个确定的结点，其子结点都有一属性来定义对应行动的相对优良程度。
井字棋其实就是三子棋(和五子棋类似，只是3个相连获胜)，它的棋盘只有3*3(Alpha beta pruning algorithm for tic tac toe
In a simple game, the algorithm that searches the game tree from the current game state and determines the optimal action scheme exists. One of the most famous algorithms is minimax algorithm. Minimax algorithms are useful for simple double games. It's one of the best ways to choose the best action in a game of action.
Each node in a game tree (a node represents a possible action plan) can store a value that defines the goodness of the corresponding action in helping the player win. Therefore, for a definite node, its sub node has an attribute to define the relative degree of good action.
Well character chess is actually the game (and only 3 linked similar 331, winning the chessboard, only 3*3)) Platform: |
Size: 1024 |
Author:oracl
|
Hits:
Description: Alpha–beta pruning is a search algorithm that seeks to decrease the number of nodes that are uated by the minimax algorithm in its search tree. It is an adversarial search algorithm used commonly for machine playing of two-player games (Tic-tac-toe, Chess, Go, etc.). Platform: |
Size: 4096 |
Author:AG |
Hits:
Search - tic tac toe MINIMAX