搜索资源列表
Othello
- 使用java编写的GUI的黑白棋游戏，搜索算法采用经典的博弈树，并在此基础上做了大量优化，我的评估函数采用了Simon M. Lucas 和 Thomas P. Runarsson 在其合作发表的 Temporal Difference Learning Versus Co-Evolution for Acquiring Othello Position Evaluation 中通过对比即时差分学习（TDL，Temporal Difference Learning）和协同进化（CEL，Co-
Java_wuziqi
- 本文介绍在NeatBeans IDE 5.0环境中开发五子棋人机对战版的过程,并且对人机博弈的基础算法进行了详细的探讨-This article describes the NeatBeans IDE 5.0 development environment, human-machine Versus Renju version of the process, and human-computer game based on the algorithm was examined in detail
Alpha_Beta
- 对于给定的Alpha_Beta博弈树，使用Alpha_Beta剪枝算法对其进行剪枝，输出剪掉的结点。-For a given Alpha_Beta game tree pruning algorithm using Alpha_Beta tree was pruned to cut output nodes.
solve
- 独粒钻石棋求解属于计算机人工智能中的博弈问题, 本文介绍了一种基于遗传算法的解决方案并用Java语言加以实现.-failed to translate
Multi-Agent-Reinforcement-Learning
- 基于多Agent的学习博弈算法，可以实现多种算法，比如Minmax,FriendQ等，接口可扩展，实现较方便。-Multi-Agent-based learning game algorithm can achieve a variety of algorithms, such as Minmax, FriendQ and other interfaces can be extended to achieve more convenient.
chess2.0
- 人工智能博弈树，采用极大极小搜索和α-β剪枝算法，搜索深度为2的棋盘博弈-Artificial intelligence game tree, using the minimax search with alpha beta pruning algorithm, the search depth is a chessboard game of 2