Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Expectiminimax_tree> ?p ?o }
Showing triples 1 to 47 of
47
with 100 triples per page.
- Expectiminimax_tree abstract "An expectiminimax tree is a specialized variation of a minimax game tree for use in artificial intelligence systems that play two-player zero-sum games such as backgammon, in which the outcome depends on a combination of the player's skill and chance elements such as dice rolls. In addition to "min" and "max" nodes of the traditional minimax tree, this variant has "chance" ("move by nature") nodes, which take the expected value of a random event occurring. In game theory terms, an expectiminimax tree is the game tree of an extensive-form game of perfect, but incomplete information.In the traditional minimax method, the levels of the tree alternate from max to min until the depth limit of the tree has been reached. In an expectiminimax tree, the "chance" nodes are interleaved with the max and min nodes. Instead of taking the max or min of the utility values of their children, chance nodes take a weighted average, with the weight being the probability that that child is reached.The interleaving depends on the game. Each "turn" of the game is evaluated as a "max" node (representing the AI player's turn), a "min" node (representing a potentially-optimal opponent's turn), or a "chance" node (representing a random effect or player).For example, consider a game in which each round consists of a single dice throw, and then decisions made by first the AI player, and then another intelligent opponent. The order of nodes in this game would alternate between "chance", "max" and then "min".".
- Expectiminimax_tree wikiPageID "1153192".
- Expectiminimax_tree wikiPageLength "3656".
- Expectiminimax_tree wikiPageOutDegree "23".
- Expectiminimax_tree wikiPageRevisionID "651480053".
- Expectiminimax_tree wikiPageWikiLink Artificial_intelligence.
- Expectiminimax_tree wikiPageWikiLink Backgammon.
- Expectiminimax_tree wikiPageWikiLink Category:Game_artificial_intelligence.
- Expectiminimax_tree wikiPageWikiLink Category:Game_theory.
- Expectiminimax_tree wikiPageWikiLink Category:Search_algorithms.
- Expectiminimax_tree wikiPageWikiLink Category:Trees_(data_structures).
- Expectiminimax_tree wikiPageWikiLink Complete_information.
- Expectiminimax_tree wikiPageWikiLink Donald_Michie.
- Expectiminimax_tree wikiPageWikiLink Expected_value.
- Expectiminimax_tree wikiPageWikiLink Extensive-form_game.
- Expectiminimax_tree wikiPageWikiLink Game_of_chance.
- Expectiminimax_tree wikiPageWikiLink Game_theory.
- Expectiminimax_tree wikiPageWikiLink Game_tree.
- Expectiminimax_tree wikiPageWikiLink Games_of_chance.
- Expectiminimax_tree wikiPageWikiLink Incomplete_information.
- Expectiminimax_tree wikiPageWikiLink Minimax.
- Expectiminimax_tree wikiPageWikiLink Move_by_nature.
- Expectiminimax_tree wikiPageWikiLink Perfect_information.
- Expectiminimax_tree wikiPageWikiLink Pseudocode.
- Expectiminimax_tree wikiPageWikiLink Utility.
- Expectiminimax_tree wikiPageWikiLink Zero-sum.
- Expectiminimax_tree wikiPageWikiLink Zero-sum_game.
- Expectiminimax_tree wikiPageWikiLinkText "Expectiminimax tree".
- Expectiminimax_tree wikiPageWikiLinkText "expectiminimax tree".
- Expectiminimax_tree hasPhotoCollection Expectiminimax_tree.
- Expectiminimax_tree subject Category:Game_artificial_intelligence.
- Expectiminimax_tree subject Category:Game_theory.
- Expectiminimax_tree subject Category:Search_algorithms.
- Expectiminimax_tree subject Category:Trees_(data_structures).
- Expectiminimax_tree hypernym Variation.
- Expectiminimax_tree type Food.
- Expectiminimax_tree type Algorithm.
- Expectiminimax_tree type Structure.
- Expectiminimax_tree type Technique.
- Expectiminimax_tree comment "An expectiminimax tree is a specialized variation of a minimax game tree for use in artificial intelligence systems that play two-player zero-sum games such as backgammon, in which the outcome depends on a combination of the player's skill and chance elements such as dice rolls. In addition to "min" and "max" nodes of the traditional minimax tree, this variant has "chance" ("move by nature") nodes, which take the expected value of a random event occurring.".
- Expectiminimax_tree label "Expectiminimax tree".
- Expectiminimax_tree sameAs Expectiminimax-Algorithmus.
- Expectiminimax_tree sameAs m.04btf_.
- Expectiminimax_tree sameAs Q1384259.
- Expectiminimax_tree sameAs Q1384259.
- Expectiminimax_tree wasDerivedFrom Expectiminimax_tree?oldid=651480053.
- Expectiminimax_tree isPrimaryTopicOf Expectiminimax_tree.