AIbase
Product LibraryTool Navigation

MiniMax-01

Public

MiniMax-01 is a simple implementation of the MiniMax algorithm, a widely used strategy for decision-making in two-player turn-based games like Tic-Tac-Toe. The algorithm aims to minimize the maximum possible loss for the player, making it a popular choice for developing AI opponents in various game scenarios.

Creat2025-01-15T23:43:39
Update2025-03-27T11:13:17
2.5K
Stars
1
Stars Increase

Related projects