minimax-01

Here are 2 public repositories matching this topic...

xlite-dev / Awesome-LLM-Inference

📚A curated list of Awesome LLM/VLM Inference Papers with Codes: Flash-Attention, Paged-Attention, WINT8/4, Parallelism, etc.🎉

mla vllm llm-inference awesome-llm flash-attention tensorrt-llm paged-attention deepseek flash-attention-3 deepseek-v3 minimax-01 deepseek-r1 flash-mla qwen3

Updated Jun 30, 2025
Python

Delxrius / MiniMax-01

Star

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.

chatbot minimax chat-api llm llm-inference flash-attention tensorrt-llm paged-attention deepseek hailuoai deepseek-v3 minimax-text-01 minimax-vl-01 minimax-01

Updated Jul 8, 2025

Improve this page

Add a description, image, and links to the minimax-01 topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the minimax-01 topic, visit your repo's landing page and select "manage topics."

Learn more

Provide feedback

Saved searches

Use saved searches to filter your results more quickly