Un-winnable game of Tic Tac Toe using MinMax
-
Updated
Jan 18, 2017 - Ruby
Un-winnable game of Tic Tac Toe using MinMax
A game of checkers written using minmax algorithm and alpha-beta pruning.
High-performance time series downsampling algorithms for visualization
Animal Fight Chess Game(斗兽棋) written in rust.
Implementing COP-Kmeans and PC-Kmeans
A MinMax based Othello/Reversi AI for 8x8 & 10x10
📜 A fully functional Othello (Reversi) game, with several AIs, made in prolog for swipl.
In this project we try to create a sophisticated computer agent to play the Contact Bridge card game. Our goal is to develop an agent that is tough to play against, with fast reaction time so it is able to play in real time against humans. We approached this as a search problem, and implemented search-tree heuristics based on Minimax and Monte C…
Javascript utility functions for web development
Tic-Tac-Toe Game with an unbeatable AI using Minimax Algorithm
Baghchal implementation in Python
A Java Go game with ancient rules integration, SGF support and AI mechanics
An AI based board game developed with Pygame.
Minmax (minimax) algorithm with Alpha-Beta (𝛼−𝛽, ab) Pruning optimization for the Checkers (Draughts) game in Python 3. Same minimax algorithm works for chess, tic tac toe or similar games.
Very simple checkers bot made using minimax algorithm with alpha-beta pruning to calculate the ideal move.
🏆 Make an AI capable of beating human players at Gomoku
Add a description, image, and links to the minmax topic page so that developers can more easily learn about it.
To associate your repository with the minmax topic, visit your repo's landing page and select "manage topics."