Chess game

Unbeatable Tic Tac Toe game in java with gui

Chess game with one or two players. In either mode, only valid moves can be performed. In one-player mode, minimax alpha-beta pruning is used to determine the computer's moves.

Chineese-checker game by minmax algorithm and alpha beta algorithm

AI Bases andorid Tic Tac Toe

Reversi game with Min-Max algorithm with alpha-beta pruning

MinMax AI with Alpha-beta pruning for Othello board game

First project for the ‘Fundamentals of Artificial Intelligence’ course. Created AI engine based on MinMax algorithm to play Connect Four game. Type of each player (human/AI) and AI parameters (depth of MinMax tree, enabling alpha-beta pruning) can be set, so it is possible to run AI vs AI game with different parameters.

This is a java OOP of mastermind game and also includes an AI that use Knuth Algorithm to guess the code

USC-Foundations of Artificial Intelligence Codes

Supervised learning to play Tic Tac Toe. Learn a correct move for all positions from generated labels by minimax search.

Example of MinMax Algorithm to implement a game in Java

A simple chess engine in Java

Tic Tac Toe game in both python and java with Artificial Intelligence for second player using alpha-beta pruning for MiniMax algorithm.

A Java GUI application for playing Tic-Tac-Toe againts the computer. The Game implements the Min-Max algorithm where the computer maximizes its chance for winning the game.

JavaFX GUI based TicTacToe with a AI MinMax opponent

Implementación del juego de Gato, Tres en raya o Tic tac toe en Java. Creado en 2009.

An AI agent is created which plays the game of Hex using min-max and alpha-beta pruning to best his human counterparts. The AI moves are evaluated using the evaluation function in which different heuristics are used to select the best move. The alpha-beta pruning helps in finding the best move faster.

A small desktop game that just won't let you win