TERMIUM Plus^®

Record 1,  Textual support,  English

Record number: 1, Textual support number: 1 DEF

In a tree structure, a search in which it is possible to decide, at each step, which part of the tree may be rejected without a further search.  4, record 1, English, - tree%20search

Record number: 1, Textual support number: 1 CONT

Techniques of tree search are of primary interest in game playing and theorem-proving programs.  5, record 1, English, - tree%20search

Record number: 1, Textual support number: 1 OBS

tree search: designation and definition standardized by ISO in collaboration with the International Electrotechnical Commission.  6, record 1, English, - tree%20search

Record number: 1, Textual support number: 2 OBS

tree search: designation standardized by Canadian Standards Association.  6, record 1, English, - tree%20search

Record 1,  Textual support,  French

Record number: 1, Textual support number: 1 DEF

Sur des données ayant une structure arborescente, recherche dans laquelle on rejette à chaque étape la partie de l'arborescence ne contenant pas les données cherchées.  5, record 1, French, - recherche%20arborescente

Record number: 1, Textual support number: 1 CONT

La recherche arborescente est couramment utilisée pour résoudre des problèmes de jeu, de planification et de prise de décision.  6, record 1, French, - recherche%20arborescente

Record number: 1, Textual support number: 1 OBS

recherche arborescente : désignation et définition normalisées par l'ISO en collaboration avec la Commission électrotechnique internationale.  7, record 1, French, - recherche%20arborescente

Record number: 1, Textual support number: 2 OBS

recherche arborescente : désignation normalisée par l'Association canadienne de normalisation.  7, record 1, French, - recherche%20arborescente

Record 1,  Textual support,  Spanish

Record number: 1, Textual support number: 1 DEF

Método para buscar en un cuerpo de datos estructurado como árbol.  1, record 1, Spanish, - b%C3%BAsqueda%20de%20%C3%A1rbol

Record 2,  Textual support,  English

Record number: 2, Textual support number: 1 CONT

A game tree is a representation of the possibilities of two players in a game, like chess. At the top of the tree is the current game position, and each arc out represents a legal move for the first player. In turn, these lead to new positions and new outgoing arcs that are the legal moves for the second player. These arcs and positions can continue until each sequence leads to the end of the game.  2, record 2, English, - game%20tree

Record number: 2, Textual support number: 2 CONT

As is usual for game trees, the tree is drawn inverted with the root at the top. In the tree every node has as its immediate descendants-its offspring nodes-all the nodes which are reachable in one legal node.  3, record 2, English, - game%20tree

Record 2,  Textual support,  French

Record 2,  Textual support,  Spanish

Record number: 2, Textual support number: 1 CONT

Un árbol de juego es una representación gráfica que muestra una situación estratégica como una secuencia de movimientos, más que como una lista de opciones de pago simultáneas como en una matriz de pagos. En este, los nodos representan puntos de decisión para los jugadores, mientras que las ramas emergentes de cada nodo representan las posibles acciones disponibles. El final de cada rama, conocido como nodo terminal, se asocia con un resultado específico o pago para cada jugador.  1, record 2, Spanish, - %C3%A1rbol%20de%20juego

Record 3,  Textual support,  English

Record 3,  Textual support,  French

Record number: 3, Textual support number: 1 CONT

Ce sont les règles du jeu et la façon d'obtenir la liste des coups possibles à chaque étape qui déterminent le parcours d'un arbre de jeu implicite.  1, record 3, French, - arbre%20de%20jeu%20implicite

Record 3,  Textual support,  Spanish

Record 4,  Textual support,  English

Record number: 4, Textual support number: 1 DEF

... a search algorithm that seeks to decrease the number of nodes that are evaluated by the minimax algorithm in its search tree.  4, record 4, English, - alpha%2Dbeta%20pruning%20algorithm

Record number: 4, Textual support number: 1 CONT

An alpha-beta algorithm is able to evaluate a game tree at reduced cost by ignoring subtrees that cannot affect the final value of the root node.  5, record 4, English, - alpha%2Dbeta%20pruning%20algorithm

Record 4,  Textual support,  French

Record number: 4, Textual support number: 1 DEF

Algorithme de recherche qui permet de limiter le nombre de situations étudiées sans perdre d'informations.  4, record 4, French, - algorithme%20d%27%C3%A9lagage%20alpha%2Db%C3%AAta

Record number: 4, Textual support number: 1 CONT

Pour les programmes d'échecs, l'heuristique à mouvement nul est une technique heuristique utilisée pour améliorer la vitesse de l'algorithme d'élagage alpha-bêta.  1, record 4, French, - algorithme%20d%27%C3%A9lagage%20alpha%2Db%C3%AAta

Record 4,  Textual support,  Spanish

Record number: 4, Textual support number: 1 OBS

[...] es el más utilizado en las aplicaciones referidas a juegos, dada su excepcional utilidad en el aumento de la velocidad de la búsqueda sin producir pérdidas de información.  1, record 4, Spanish, - algoritmo%20de%20poda%20alfa%20beta

Record 5,  Textual support,  English

Record number: 5, Textual support number: 1 CONT

The minimax algorithm assumes there are two players called Max and Min, and assigns a value to every node in a game tree.  1, record 5, English, - minimax%20algorithm

Record 5,  Textual support,  French

Record number: 5, Textual support number: 1 CONT

L'algorithme minimax (aussi appelé algorithme MinMax) est un algorithme qui s'applique à la théorie des jeux pour les jeux à deux joueurs à somme nulle (et à information complète) consistant à minimiser la perte maximum (c'est-à-dire dans le pire des cas).  1, record 5, French, - algorithme%20minimax

Record 5,  Textual support,  Spanish

Record number: 5, Textual support number: 1 CONT

El algoritmo minimax en simples palabras consiste en la elección del mejor movimiento para el computador, suponiendo que el contrincante escogerá uno que lo pueda perjudicar; para escoger la mejor opción este algoritmo realiza un árbol de búsqueda con todos los posibles movimientos, luego recorre todo el árbol de soluciones del juego a partir de un estado dado, es decir, según las casillas que ya han sido rellenadas.  1, record 5, Spanish, - algoritmo%20minimax

Record 6,  Textual support,  English

Record number: 6, Textual support number: 1 CONT

Any income you receive from tilling soil, raising livestock, maintaining racehorses or other such farming activities counts as farming income. In addition to income from dairy, fruit and tree farms, you also have to declare income from beekeeping and wild game reserves. In some cases, income from raising fish, plant nurseries or maple sugar bushes can also qualify as farming income.  4, record 6, English, - farm%20income

Record 6,  Textual support,  French

Record 6,  Textual support,  Spanish

Record number: 6, Textual support number: 1 OBS

ingreso agrícola: designación utilizada generalmente en plural.  2, record 6, Spanish, - ingreso%20agr%C3%ADcola

Record 7,  Textual support,  English

Record number: 7, Textual support number: 1 DEF

Game for 2-4 players in which the aim is to build a tree.  1, record 7, English, - L%26rsquo%3BArbre%20de%20Mako%26trade%3B

Record number: 7, Textual support number: 1 OBS

L’Arbre de Mako™: A trademark of Mako (France).  1, record 7, English, - L%26rsquo%3BArbre%20de%20Mako%26trade%3B

Record 7,  Textual support,  French

Record number: 7, Textual support number: 1 DEF

Jeu de société pour 2 à 4 joueurs dont le but consiste à construire un arbre.  1, record 7, French, - L%27Arbre%20de%20Mako

Record number: 7, Textual support number: 1 OBS

L'Arbre de Mako^MC : Marque de commerce de la société Mako, France.  1, record 7, French, - L%27Arbre%20de%20Mako

Record 7,  Textual support,  Spanish

Record 8,  Textual support,  English

Record number: 8, Textual support number: 1 DEF

A game tree in which the top node represents the starting position and the shape or color of the node represents the player whose turn is associated with the node.  1, record 8, English, - explicit%20game%20tree

Record 8,  Textual support,  French

Record number: 8, Textual support number: 1 OBS

Voir arbre de jeu.  1, record 8, French, - arbre%20de%20jeu%20explicite

Record 8,  Textual support,  Spanish

Record 9,  Textual support,  English

Record number: 9, Textual support number: 1 CONT

Another search procedure that can be used to operate on game trees is called the alpha-beta or backward pruning procedure. Compared to depth-first minimax, the pruning possible with this process can reduce the number of computations by several orders of magnitude. It combines the tree generation and position evaluation procedures. One advantage is that if one finds the best path in the initial branch generation and evaluation, it is not necessary to generate and evaluate the reminder of the tree.  1, record 9, English, - backward%20pruning%20procedure

Record 9,  Textual support,  French

Record number: 9, Textual support number: 1 OBS

alpha-bêta : en théorie des jeux et en résolution de problèmes, procédure mettant en présence deux variables (alpha et bêta) qui permettent d'élaguer la recherche tout en cherchant la solution optimale.  1, record 9, French, - proc%C3%A9dure%20d%27%C3%A9lagage%20alpha%2Db%C3%AAta

Record 9,  Textual support,  Spanish

Record 10,  Textual support,  English

Record number: 10, Textual support number: 1 DEF

A procedure for generating game trees which generally works in a left to right manner by first generating all successive positions on the left side of the tree through the termination of the graph or to some intermediate position.  1, record 10, English, - depth%2Dfirst%20generation

Record 10,  Textual support,  French

Record number: 10, Textual support number: 1 OBS

Voir génération largeur d'abord.  1, record 10, French, - g%C3%A9n%C3%A9ration%20profondeur%20d%27abord

Record 10,  Textual support,  Spanish