Tic-tac-toe using the Minimax algorithm.
-
Updated
Apr 14, 2021 - Go
Tic-tac-toe using the Minimax algorithm.
This is a project made in Golang from a game of tic-tac-toe that never loses. Using the minimax algorithm, I created an interesting gaming experience where the game never loses.
Learning go and recreating a school lab i did in game artificial intelligence for my algorithms and data structures course. Originally made in java
minimax, minimax with alpha-beta prunning, semi-parallel minimax
Invincible AI written in Go for Tic Tac Toe game.
2048 engine
Chess engine, AI, cli interface, and websocket client ♞
Connect4 solver: Minimax with alpha-beta pruning
tic-tac-toe implementation & solver, using raylib for the gui and minimax + alpha-beta pruning for the solver
A command-line Connect Four human-vs-computer program.
A command-line Othello game and experiment using AWS API Gateway WebSocket APIs and AWS Lambda
💸 MiniMax wrapper for Go SDK MINIMAX 大语言模型 golang SDK
Add a description, image, and links to the minimax topic page so that developers can more easily learn about it.
To associate your repository with the minimax topic, visit your repo's landing page and select "manage topics."