Description: 使用Alpha, Beta剪枝的，能控制搜索层数，用MFC实现的一字棋程序。界面好看，算法优美。-The use of Alpha, Beta pruning, and can control the search the number of layers to achieve the word with MFC chess program. Interface look good, beautiful algorithm. Platform: |
Size: 660480 |
Author:蚂蚁 |
Hits:
Description: 中国象棋
本人机对弈程序采用了多种搜索算法.以下是本程序主要的类说明:
1.CEveluation类:估值类,对给定的棋盘进行估值.
2.CMoveGenerator类:走法产生器,对给定的棋盘局面搜索出所有可能的走法.
3.CSearchEngine类:搜索引擎基类.
4.CNegaMaxEngine类:负极大值法搜索引擎.
5.CAlphaBetaEngine类:采用了Alpha-Beta剪枝技术的搜索引擎.
6.CFAlphaBetaEngine类:fail-softalpha-beta搜索引擎.
7.CHistoryHeuristic类:历史启发类.
8.CAlphabeta_HHEngine类:带历史启发的Alpha-Beta搜索引擎.
9.CAspirationSearch类:渴望搜索引擎.
10.CIDAlphabetaEngine类:迭代深化搜索引擎.
11.CMTD_fEngine类:MTD(f)搜索引擎.
12.CTranspositionTable类:置换表.
13.CAlphaBeta_TTEngine类:加置换表的Alpha-Beta搜索引擎.
14.CPVS_Engine类:极小窗口搜索引擎.
15.CNegaScout_TT_HH类:使用了置换表和历史启发的NegaScout搜索引擎.
本程序还具有悔棋,还原功能,还可以记录走法.
注:本程序编写时参考了王小春的<<PC游戏编程(人机博弈)>>,他的书真是好.-Chinese chess game machine procedure I used a variety of search algorithm. The following are the major types of procedures that: Platform: |
Size: 150528 |
Author:ccg |
Hits:
Description: 本程序在Windows98下用VC6.0编译通过，所使用位图来源于“象棋大师”教学软件， 设计和改进时参考了BorlandC++3.1的国际象棋程序和陈成涛所写的“中国象棋程序”。 在算法上采用有界深度优先Alpha-Beta剪枝递归搜索技术-The program under Windows98 using VC6.0 to compile, the use of bitmap from " Chess Master" teaching software design and improvement of reference of the BorlandC++3.1 and Chen Chengtao chess program written by the " Chinese chess program." Adopted in the algorithm bounded depth-first Alpha-Beta pruning recursive search Platform: |
Size: 455680 |
Author:guanmj |
Hits:
Description: Java版中国象棋项目设计源代码及论文，还附有成品可运行的文件。
20世纪60年代初，麦卡锡提出了alpha-beta修剪算法，把为决定下一个走步而需对棋盘状态空间的搜索量从指数级减少为指数的平方根，大大地提高了机器下棋的水平。IBM的超级计算机“Deep Blue”更是一个神话，让棋迷们神往。本文根据国际象棋程序设计的一些成功经验，提出中国象棋程序设计的一些思路和方法。-Chinese Chess Java version of the project design source code and papers, also can be run with a finished document. 60 early 20th century, McCarthy proposed alpha-beta pruning algorithm for the decision to walk and take the next state space on the board' s search volume index from the index level was reduced to the square root, greatly enhanced the level of chess machine. IBM supercomputer " Deep Blue" is a myth, so that chess fans were fascinated. This chess program designed according to some successful experience, raise a number of Chinese chess programming ideas and methods. Platform: |
Size: 1343488 |
Author:王德金 |
Hits:
Description: 用alpha-beta剪枝算法实现的一字棋（井字棋）对弈程序。由网上另外一个代码改进而来（感谢原作者）。增强了棋力-Alpha-beta pruning algorithm of the word chess-playing program (Tic-Tac-chess). Improvements comes from another online code (thanks to the original author). Enhance the playing strength Platform: |
Size: 33792 |
Author:nullspace |
Hits:
Description: 基于window下的小游戏。代码一共1800行，用c++编写，核心算法是alpha-beta搜索，使用directx，没有使用MFC和GDI，没有运用面向对象思想，这样可以让读者只需要关心核心的算法与数据结构。-Under the window-based mini-games. A total of 1800 line code with c++ written, the core algorithm is the alpha-beta search, use directx, do not use MFC and GDI, without the use of object-oriented thinking, This allows the reader need only concern the core algorithms and data structures. Platform: |
Size: 3507200 |
Author:贺雪冬 |
Hits:
Description: 运用博弈树和α-β剪枝算法完成的一个黑白棋游戏小程序(Using game tree and alpha - beta pruning algorithm to complete a small game of black and white chess game) Platform: |
Size: 3072 |
Author:Ray0218
|
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 - alpha beta algorithm of chess