Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Negamax> ?p ?o. }
Showing items 1 to 31 of
31
with 100 items 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 wikiPageID "1732703".
- Negamax wikiPageRevisionID "599469065".
- Negamax hasPhotoCollection Negamax.
- Negamax subject Category:Articles_with_example_pseudocode.
- Negamax subject Category:Game_artificial_intelligence.
- Negamax subject Category:Optimization_algorithms_and_methods.
- Negamax type Abstraction100002137.
- Negamax type Act100030358.
- Negamax type Activity100407535.
- Negamax type Algorithm105847438.
- Negamax type Event100029378.
- Negamax type OptimizationAlgorithmsAndMethods.
- Negamax type Procedure101023820.
- Negamax type PsychologicalFeature100023100.
- Negamax type Rule105846932.
- Negamax type YagoPermanentlyLocatedEntity.
- 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 label "Negamax".
- Negamax label "Negamax".
- Negamax sameAs Negamax.
- Negamax sameAs Negamax.
- Negamax sameAs m.05rx6j.
- Negamax sameAs Q3874238.
- Negamax sameAs Q3874238.
- Negamax sameAs Negamax.
- Negamax wasDerivedFrom Negamax?oldid=599469065.
- Negamax depiction Plain_Negamax.gif.
- Negamax isPrimaryTopicOf Negamax.
