| FazBrowse GitHub Viewer | Trending | | Home |
| Tools: [Download Repo ZIP] [Original HTTPS Page] |
C++ Gomoku with a strong AI based on minimax search and alpha-beta pruning with Qt5 GUI. *Dozens of C++ tricks & hacks are used to improve efficiency.* Come and try to see if you can beat the powerful AI!
A game of checkers written using minmax algorithm and alpha-beta pruning.
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…
Unbeatable Tic Tac Toe game in java with gui
#️⃣ㅤA C program for a game of TicTacToe using Artificial Intelligence
Tic-Tac-Toe Game with an unbeatable AI using Minimax Algorithm
Chess game with React and min-max algorithm implementation
A simple but smart TicTacToe game made using Flutter
A doudizhu(chinese poker) final phase cracker. (欢乐)斗地主残局分析器
A panoply of algorithms in game theory, econometrics, linear programming, and Montecarlo simulations.
Chess Engine Implementation using Minmax, Alpha-Beta Pruning, and Quiescence Search Algorithm.
A Pacman game implementation with an AI player using the Minimax algorithm. This project showcases the classic Pacman game environment, where the player (Pacman) navigates a maze to collect points while avoiding ghosts. The AI-controlled ghosts aim to catch Pacman.
My version of Tic-Tac-Toe. built with Reactjs and Redux. Same old game, more possibilities.
🧠 chess ai utilizing minmax w/ alpha-beta pruning
🏆 Make an AI capable of beating human players at Gomoku
Baghchal implementation in Python
A modern Chess Game built in Python (Tkinter) with a beautiful GUI, Bot opponent using Minimax + Alpha-Beta pruning, move history, timers, board flipping, sounds, and more!
This is a simple JavsScript based Tic-Tac-Toe game. We used Minimax Algorithm to make a bot to play against. This way, the user plays with a clever bot than a bot that takes random moves.
Add a description, image, and links to the minmax-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the minmax-algorithm topic, visit your repo's landing page and select "manage topics."
| Back | FazBrowse Home | New Git URL |