mini-max-algorithm

MiniMax H3 ComfyUI - Run MiniMax turbo lora H3 33B omni-modal AI model locally with ComfyUI workflow. Text-to-video, image-to-video, reference-to-video generation with native stereo audio. ComfyUI custom nodes, workflow templates (T2V, I2V, R2V), H3-VisualVAE and H3-AudioVAE decoders. ComfyUI v0.31.0 support. 4-15s video at 768p. github

The mancala game consists of two-player, which is a turn-based strategy board games. There are two modes i) player vs player ii)AI Bot vs player. AI Bots works on Mini Max Algorithm

It's Tic-Tac-Toe Unbeatable A.I.

Implementation of Tic tac toe game using mini-max algorithm and alpha-beta pruning with JavaFX

Gomoku game integrating an AI player capable of beating a human player the fastest way possible. Implementing a min-max algorithm, trial and error to find the most adapted heuristics. This will not be as easy as checkers.

Tic Tac Toe game built with vanilla JS

TicTacToe with mini max algorithm

Droughts console game with Alpha-beta pruning as a modified version of the minimax algorithm

I implemented a simple version of the Quoridor game which users can play against an AI designed using minimax and alpha-beta pruning algorithm.

Game Othelo (Reversi) made in WPF with several AI implementations

Artificial Intelligence (COMP 424) Project

Unbeatable Tic-Tac-Toe AI in Python — compares Minimax vs Alpha-Beta Pruning with live stats on nodes explored, pruning, and speed.

Tic-tac-toe is a game in which two players take turns in drawing either an ' O' or an ' X' in one square of a grid consisting of nine squares. The winner is the first player to get three squares of the same symbols in a row, column or diagonal. This C++ Code uses the MiniMax Algorithm to play as computer opponent.

Optimization of Connect4 Game using Mini-Max Algorithm and Alpha-Beta Pruning Algorithm.

Tic Tac Toe Game Using Mini Max Algorithm

Tic Tac Toe using game theory