🎮 使用α-β剪枝(Alpha-beta-pruning)的极小极大算法(Minimax-algorithm)实现的井字棋(一字棋、tic-tac-toe)游戏。
-
Updated
Oct 27, 2017 - C++
🎮 使用α-β剪枝(Alpha-beta-pruning)的极小极大算法(Minimax-algorithm)实现的井字棋(一字棋、tic-tac-toe)游戏。
Othello/Reversi AI - minimax search with alpha beta pruning
A c++ program to play tic-tac-toe with minimax tree. Try to beat and it ;-)
🥇 Unbeatable Tic Tac Toe game with a README contains very thing about MiniMax algorithms with explanation of it with c++ and js Implementation code
AI bot for the 2-player board game "Game of the Amazons"
Collection of AI algorithms to solve/optimize 2048 games.
An AI bot to play the game of YINSH using optimised alpha beta pruning based minimax search.
TicTacToe AI that utilizes the Minimax Algorithm and the Alpha Beta Pruning Algorithm to reduce Game-Tree searches.
Tic Tac Toe game with the AI as opponent. The AI is implemented as a Minimax algorithm.
Example of implementing a minimax algorithm for a simple TicTacToe game made for the desktop with Qt.
Add a description, image, and links to the minimax-search topic page so that developers can more easily learn about it.
To associate your repository with the minimax-search topic, visit your repo's landing page and select "manage topics."