搜索资源列表
Games
- Bayes分类器——算法设计 1． 使用决策树(Decision tree)分类算法、朴素贝叶斯（Naï ve Bayes）算法或者K-近邻（kNN）算法（三者任选其一）对给定的训练数据集构造分类器，并在测试数据集上进行分类预测。 2． 数据集描述： Tic-tac-toe游戏的二叉分类。Tic-tac-toe游戏示例如下-Bayes classifier- Algorithm 1. Using the decision tree (Decision tree) classi
tictactoe
- c#编写的井字棋小游戏，可以调节难度，但是要求节点的数目随之更改-c# written in Tic-Tac-chess game, you can adjust the difficulty, but the number of nodes required to be changed accordingly
tictactoe
- 机器学习三子棋学习题目，适合初学者学习。-Three sons and chess machine learning to learn the subject, suitable for beginners to learn.
TicTacToe
- 将强化学习算法应用于Tic-tac-toe游戏-The reinforcement learning algorithm is applied to Tic-tac-toe game
tic-tac-toe
- 在VC环境下用C++语言编写的一字棋小程序，采用人工智能原理里的博弈树的启发式搜索原理-VC environment in C++ language with the preparation of the word game of small procedures, the principle of the use of artificial intelligence in the game tree search heuristic principle
agame
- 一个井字棋的游戏 可供人工智能初学者参考 简单的博弈-A tic-tac-toe game of chess in artificial intelligence for the game easy for beginners reference
MaxMinAlgo
- 使用人工智能极大值极小值算法实现的井字棋游戏，有完整的工程及源码注释，可直接运行，并附带了程序运行的示例截图。-Maximum use of artificial intelligence algorithms to achieve the minimum chess game Tic Tac Toe, a complete engineering and source notes, can be directly run, and run the sample with a screensho
deom
- matlab 实现对九宫格 的 胜负分类-classify the tic-tac-toe data to postive or negative
Tic-tac-toe
- 这是一字棋的源代码，在VC++环境系运行-This is the word chess source code, run in VC++ Environment Department of
tic-tac-toe-python
- 基于遗传算法的井字棋不败策略搜索，找到全部独立765个状态之后的搜索-Tic Tac Toe game based on genetic algorithm search strategies unbeaten
tic-tac-toe
- 人工智能基于α-β剪枝树的四阶一字棋游戏-Artificial Intelligence based α-β pruning trees fourth-order word chess game
Alph_Beta_Game
- Java code for Tic tac to using alph beta search
vishal_sahu_sep15
- 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,
JZQ
- 利用极大极小值搜索算法实现井字棋游戏，包含一些优化算法过程-Use Minimax search algorithm Tic-tac-toe game, including some optimization process
一字棋
- 井字棋 α-β剪枝算法 在简单的游戏中，能够从当前游戏状态出发，搜索游戏的博弈树并确定最优行动方案的算法是存在的。其中最有名的算法就是极小极大算法。对于简单的双人游戏，极小极大算法很有用。它是在轮流行动的游戏中选择最好的行动的一种方法。 在博弈树中的每一个结点（一个结点表示一个可能的行动方案）都可以保存一个值，该值用来定义对应行动在帮助玩家获胜方面的优良程度。因此，对于一个确定的结点，其子结点都有一属性来定义对应行动的相对优良程度。 井字棋其实就是三子棋(和五子棋类