Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Negamax> ?p ?o }
Showing triples 1 to 52 of
52
with 100 triples per page.
- Negamax abstract "Negamax search is a variant form of minimax search that relies on the zero-sum property of a two-player game.This algorithm relies on the fact that max(a, b) = −min(−a, −b) to simplify the implementation of the minimax algorithm. More precisely, the value of a position to player A in such a game is the negation of the value to player B. Thus, the player on move looks for a move that maximizes the negation of the value of the position resulting from the move: this successor position must by definition have been valued by the opponent. The reasoning of the previous sentence works regardless of whether A or B is on move. This means that a single procedure can be used to value both positions. This is a coding simplification over minimax, which requires that A select the move with the maximum-valued successor while B selects the move with the minimum-valued successor.It should not be confused with negascout, an algorithm to compute the minimax or negamax value quickly by clever use of alpha-beta pruning discovered in the 1980s. Note that alpha-beta pruning is itself a way to compute the minimax or negamax value of a position quickly by avoiding the search of certain uninteresting positions.Most adversarial search engines are coded using some form of negamax search.".
- Negamax thumbnail Plain_Negamax.gif?width=300.
- Negamax wikiPageExternalLink Negamax.
- Negamax wikiPageExternalLink 173.c.
- Negamax wikiPageID "1732703".
- Negamax wikiPageLength "12142".
- Negamax wikiPageOutDegree "22".
- Negamax wikiPageRevisionID "656787393".
- Negamax wikiPageWikiLink Adversarial_search.
- Negamax wikiPageWikiLink Alpha-beta_pruning.
- Negamax wikiPageWikiLink Alpha–beta_pruning.
- Negamax wikiPageWikiLink Category:Articles_with_example_pseudocode.
- Negamax wikiPageWikiLink Category:Game_artificial_intelligence.
- Negamax wikiPageWikiLink Category:Optimization_algorithms_and_methods.
- Negamax wikiPageWikiLink File:Negamax_AlphaBeta.gif.
- Negamax wikiPageWikiLink File:Plain_Negamax.gif.
- Negamax wikiPageWikiLink Foreach_loop.
- Negamax wikiPageWikiLink MTD-f.
- Negamax wikiPageWikiLink Minimax.
- Negamax wikiPageWikiLink Negascout.
- Negamax wikiPageWikiLink OReilly_Media.
- Negamax wikiPageWikiLink Oreilly_Media.
- Negamax wikiPageWikiLink Principal_variation_search.
- Negamax wikiPageWikiLink Pseudocode.
- Negamax wikiPageWikiLink Search_algorithm.
- Negamax wikiPageWikiLink Transposition_table.
- Negamax wikiPageWikiLink Two-player_game.
- Negamax wikiPageWikiLink UMI_Research_Press.
- Negamax wikiPageWikiLink Zero-sum_(Game_theory).
- Negamax wikiPageWikiLink Zero-sum_game.
- Negamax wikiPageWikiLinkText "Nega-Max".
- Negamax wikiPageWikiLinkText "Negamax".
- Negamax wikiPageWikiLinkText "negamax".
- Negamax hasPhotoCollection Negamax.
- Negamax wikiPageUsesTemplate Template:Cite_book.
- Negamax subject Category:Articles_with_example_pseudocode.
- Negamax subject Category:Game_artificial_intelligence.
- Negamax subject Category:Optimization_algorithms_and_methods.
- Negamax hypernym Form.
- Negamax type Article.
- Negamax type Algorithm.
- Negamax type Article.
- Negamax comment "Negamax search is a variant form of minimax search that relies on the zero-sum property of a two-player game.This algorithm relies on the fact that max(a, b) = −min(−a, −b) to simplify the implementation of the minimax algorithm. More precisely, the value of a position to player A in such a game is the negation of the value to player B.".
- Negamax label "Negamax".
- Negamax sameAs Negamax.
- Negamax sameAs Negamax.
- Negamax sameAs m.05rx6j.
- Negamax sameAs Q3874238.
- Negamax sameAs Q3874238.
- Negamax wasDerivedFrom Negamax?oldid=656787393.
- Negamax depiction Plain_Negamax.gif.
- Negamax isPrimaryTopicOf Negamax.