MiniMax-01
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.
chat-apichatbotdeepseekdeepseek-v3flash-attentionhailuoaillmllm-inferenceminimaxminimax-01minimax-text-01minimax-vl-01paged-attentiontensorrt-llm
Github Data
Star 4
Fork 0
Subscriber 1
Language
Size 1
owner
created at 2025-01-15
updated at 2025-06-27
pushed at 2025-06-27
