game tree信息详情
[数]博弈树
tree───n.树；木料；树状物；n.(Tree)人名；(英)特里；vt.把...赶上树；vi.爬上树；逃上树
tree to tree───树到树
game───n.游戏；比赛；猎物，野味；vi.赌博；n.(Game)人名；(英)盖姆；(法)加姆；(西)加梅；adj.勇敢的
banana tree───香蕉树
apple tree───苹果树
poplar tree───杨树
salal tree───腊肠树
tree skirt───圣诞树裙
spruce tree───云杉树
minimax game tree, of course, cannot be used very well for games in which the computer cannot see the possible moves.───MGT当然不能预测所有计算机游戏的可能步骤。
The Minimax game Tree is used for programming computers to play games in which there are two players taking turns to play moves.───极小博弈树(Minimax Game Tree，简写为MGT，译者注)用于编写电脑之间的游戏程序，这类程序由两个游戏者轮流，每次执行一个步骤。
A group of boys were playing a game around a tall tree.───一群男孩围着一棵大树玩游戏。
A game tree, or the extensive form of a game is a graphical technique for displaying and analyzing sequentialmove games.───博弈树，或博弈的扩展型，是用来表示和分析序贯博弈的图形方法。
Sometimes sequential games can be solved by using rollback without drawing the complete game tree.───有时序贯博弈可以用反转方法，但不必画出完整的博弈树。
This paper gives profound research is game-tree search algorithm and game-tree optimization technique.───机器博弈是人工智能研究领域的一大热点，博弈树搜索则是机器博弈的引擎。
Had wanted to achieve the game-tree algorithms, but there is no debugging through, they gave up.───本来还想实现博弈树的算法，可是没有调试通过，就放弃了。使用的算法是贪心算法，还有随机算法。
This paper is based on the construction of the game tree, researching and analyzing the traditional algorithm of game, the defect is given.───基于博弈树的构建，对传统的博弈算法进行了分析研究，指出了其存在的不足。
The reason this data structure is named the minimax game tree is because of the simple algorithm behind the structure.───极大极小博弈树是因描绘这种结构的一种简单算法而得名。
With the combined research of many brilliant programmers, the minimax game tree evolved to become the most major component of the chess program.
So, one of the first researchers on the minimax tree decided to name player X as Max and player O as Min. Thus, the entire data structure came to be called the minimax game tree .
The minimax game tree, of course, cannot be used very well for games in which the computer cannot see the possible moves.
Notice that unlike other trees like binary trees, 2-3 tres, and heap trees, a node in the minimax game tree can have any number of children, depending on the game situation.
The process of game is described with game tree. The computation burden is greatly reduced by iterated elimination of weakly actions, and it is well suited for on-line application.
The reason this data structure is named the minimax game tree is because of the simple algorithm behind the structure.
The Minimax Game Tree is used for programming computers to play games in which there are two players taking turns to play moves.
Figure 1 presents a game tree.
The dynamic game tree method is a more formalized quantitative analysis approach for actors of strategic interaction game in political transformation between the government and the opposition.