Chineese-checker game by minmax algorithm and alpha beta algorithm
-
Updated
Jun 9, 2022 - Java
Chineese-checker game by minmax algorithm and alpha beta algorithm
Tic-Tac-Toe Game with an unbeatable AI using Minimax Algorithm
Quarto board game optimized with Genetic Algorithm and MinMax, plus Reinforcement-Learning.
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.
Second Assignment in 'Artificial Intelligence' course by Dr. Ram Meshulam at Bar-Ilan University
A chess AI (currently in development) made in Python and GUI provided by Pygame.
This repository has all of the programming assignments in the Foundations of Artificial Intelligence class at the University of Southern California in the Fall 2021 semester.
An implementation of AI player for Gomoku.
Project using minmax and alpha beta pruning to make ai for tictactoe and connect4 with gui using pygame
Used min-max alpha-beta pruning algorithm to make an AI (easy, medium, hard), implemented on the server-side with Django Rest-Framework. Used Angular for frontend.
Ultimate Tic-Tac-Toe against AI
AI player of the game 2048 (expectiminimax + alpha-beta pruning + iterative deepening search)
This project is a Python implementation of the classic Pacman game, using the MinMax algorithm for decision making.
Link Presentation : https://youtu.be/JfNR6zEKbc4
Add a description, image, and links to the minmax-alpha-beta-pruning topic page so that developers can more easily learn about it.
To associate your repository with the minmax-alpha-beta-pruning topic, visit your repo's landing page and select "manage topics."