Explore: *minimax Technique

Minimax (sometimes Minmax, MM or saddle point) is a decision rule used in artificial intelligence, decision theory, combinatorial game theory, statistics

response of colored and white pegs. The next guess is chosen by the minimax technique, which chooses a guess that has the least worst response score. In

algorithm that seeks to decrease the number of nodes that are evaluated by the minimax algorithm in its search tree. It is an adversarial search algorithm used

In statistical decision theory, a minimax estimator δ M {\displaystyle \delta ^{M}\,\!} is an estimator which performs best in the worst possible case

The expectiminimax algorithm is a variation of the minimax algorithm, for use in artificial intelligence systems that play two-player zero-sum games,

Little Machine Constructed by Minimax Dadamax in Person (Von minimax dadamax selbst konstruiertes maschinchen) (1919–20) is a mixed-media work of art by

and the computation of maximum flows. A closely related problem, the minimax path problem or bottleneck shortest path problem asks for the path that

In computer science, the Fibonacci search technique is a method of searching a sorted array using a divide and conquer algorithm that narrows down possible

concentration Minimax or maximin, a decision rule Modified Mercalli scale for earthquake intensity Molecular mechanics, computational chemistry technique Moving

In computational complexity theory, Yao's principle (also called Yao's minimax principle or Yao's lemma) relates the performance of randomized algorithms