GitHub / Delxrius / 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.
JSON API: http://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Delxrius%2FMiniMax-01
PURL: pkg:github/Delxrius/MiniMax-01
Stars: 4
Forks: 0
Open issues: 0
License: None
Language:
Size: 1000 Bytes
Dependencies parsed at: Pending
Created at: 7 months ago
Updated at: 15 days ago
Pushed at: 15 days ago
Last synced at: 15 days ago
Topics: chat-api, chatbot, deepseek, deepseek-v3, flash-attention, hailuoai, llm, llm-inference, minimax, minimax-01, minimax-text-01, minimax-vl-01, paged-attention, tensorrt-llm