High-performance time series downsampling algorithms for visualization
-
Updated
Aug 29, 2024 - Jupyter Notebook
High-performance time series downsampling algorithms for visualization
Animal Fight Chess Game(斗兽棋) written in rust.
A game of checkers written using minmax algorithm and alpha-beta pruning.
Javascript utility functions for web development
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.
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…
Un-winnable game of Tic Tac Toe using MinMax
📜 A fully functional Othello (Reversi) game, with several AIs, made in prolog for swipl.
Implementing COP-Kmeans and PC-Kmeans
Tic-Tac-Toe Game with an unbeatable AI using Minimax Algorithm
La nostra soluzione per la Tablut Challenge 2022 ♟️ (Fondamenti di Intelligenza Artificiale M)
The goal of this project was to make a User vs AI chess game, such that user makes whichever (legal) move they like and in turn, the AI performs the best move it can find. The game ends when either the user or the AI enters checkmate or stalemate state - or if you quit forcibly :)
🏆 Make an AI capable of beating human players at Gomoku
A Java Go game with ancient rules integration, SGF support and AI mechanics
Baghchal implementation in Python
Very simple checkers bot made using minimax algorithm with alpha-beta pruning to calculate the ideal move.
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."