青年中文game tree的意思
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.