Skip to content
#

minimax-vl-01

Here are 2 public repositories matching this topic...

🚀 MiniMax大模型海螺AI逆向API【特长:超自然语音】,支持MiniMax Text-01、MiniMax-VL-01模型,支持高速流式输出、语音合成、联网搜索、长文档解读、图像解析、多轮对话,零配置部署,多路token支持,自动清理会话痕迹,仅供测试,如需商用请前往官方开放平台。

  • Updated Jan 25, 2025
  • TypeScript

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.

  • Updated Feb 3, 2025

Improve this page

Add a description, image, and links to the minimax-vl-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-vl-01 topic, visit your repo's landing page and select "manage topics."

Learn more