Implementation of Tic-Tac-Toe game using mini-max algorithm in python.
-
Updated
Jan 24, 2019 - Python
Implementation of Tic-Tac-Toe game using mini-max algorithm in python.
Minimax algorithm as well as Alpha Beta pruning
Menerapkan game theory berupa mini-max pada program game nim yang turn-based dengan komputer.
Chess engine is a simple chess-ai that can be played without leaving your terminal. Chess-Engine project is made for my course CSMI11.
double card game
Machine Learning
A website to play the American Checkers game with an AI built using the Mini-Max Search Tree algorithm and Alpha-Beta pruning
Optimal Connect Four with Alpha-Beta Pruning
Droughts console game with Alpha-beta pruning as a modified version of the minimax algorithm
Object-Oriented - Python Rich Library - Mini Max Algorithm
Implementation of the client-server software system «Playing Chess»
Implementations of useful algorithms
An autonomous Tic-Tac-Toe-playing robot powered by Arduino, programmed using C++ and python. Equipped with a camera, the robot captures real-time game data, processing it using the 'minimax algorithm' to calculate the optimal move. Once determined, the robot activates its robotic arm, maneuvering the designated game piece to the desired position.
Add a description, image, and links to the mini-max topic page so that developers can more easily learn about it.
To associate your repository with the mini-max topic, visit your repo's landing page and select "manage topics."