Skip to content
#

deepseek-v3

Here are 6 public repositories matching this topic...

Language: All
Filter by language

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 Jan 18, 2025

Improve this page

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

Learn more