This is a AI bot for Chain Reaction game using minimax algorithm with alpha-beta pruning ang killer move heuristic.

A command line Java program created for an artificial intelligence course. It applies Adversarial Search Problem to a game of Tic-Tac-Toe. The program has a user playing a simulated opponent. The user uses the command line to select their moves. The opponent uses the Minimax algorithm to select the best move to counter the user's moves. This res…

A Gomoku-Playing AI. Using Minimax search with Alpha-Beta pruning.

Alpha Beta pruning Breakthrough agent

Group project on Adversarial Search Algorithms for the Curricular Unit of "Artificial Intelligence" @ FCUP, Porto with @barbara-san and @Nia3324

Tic-tac-toe-playing agent demonstrating the application of adversarial search strategies in ensuring optimal gameplay

an Java AI Bot implementation for mancala (kalah) game using alpha-beta pruned minimax algorithm

Semester project researching adversarial search algorithms and Q-learning to play dice chess.

Minimax with/without alpha-beta pruning and heuristic evaluation function.

A python implementation of chess game Gothello

A java program that plays a custom standard two-player game called Hexed!