Minimax

Last updated

What is Minimax?

Minimax is an artificial intelligence (AI) decision-making algorithm mainly used in decision making and game theory, particularly for two player zero-sum games. It formulates a strategy by simulating all possible game scenarios and assuming that the opponent is playing an optimal game. Minimax operates by the player minimizing the possible loss for a worst case scenario and thus making the 'maximum of the minimum' possible scenarios. This algorithm is often combined with alpha-beta pruning technique to increase its efficiency.

Free resources to learn Minimax

More in stage 13: Game AI

Minimax: common questions

Can I learn Minimax in Hindi?

This lesson is written in English. Once you sign in, open it in the interactive course and ask the AI tutor to explain Minimax in Hindi or Hinglish. The tutor answers from this lesson’s own text, so it stays on the syllabus, and it runs on your own Google, OpenAI or Anthropic key.

Is this Minimax tutorial for beginners?

It is lesson 112 of 144 in the free Game Developer roadmap, in stage 13, Game AI. If you are new to Game Developer, start from stage 1 and come back here in order; if you already know the earlier stages, this lesson stands on its own.

Still confused? Ask me