minimax algorithm

E2146492 UNEXPLORED

The minimax algorithm is a classic decision-making strategy in game theory and artificial intelligence that systematically evaluates possible moves to choose the optimal play in two-player, turn-based games.

Try in SPARQL Jump to: Surface forms Referenced by

All labels observed (1)

Label	Occurrences
minimax algorithm canonical	1

Referenced by (1)

Full triples — surface form annotated when it differs from this entity's canonical label.

Tic-Tac-Toe → isCommonTeachingToolFor → minimax algorithm ⓘ