La nostra soluzione per la Tablut Challenge 2022 ♟️ (Fondamenti di Intelligenza Artificiale M)

This is a fully fledged 2 or 1 player tic-tac-toe game written in TypeScript, HTML and SCSS using Ionic Framework which uses minimax algorithm with alpha beta pruning for Player vs Computer mode. It can be exported to Android, iOS, Windows, PWA or a website.

An implementation of Minimax, Alpha-Beta and Monte-Carlo Tree Search to play Connect 4

Kotlin AI for the Softwarechallenge 2018 featuring the game "Hase und Igel"

♟️ Athena is a Python-based chess engine using negamax algorithm with alpha-beta pruning, piece-square tables, Simplified Evaluation Function and move ordering♟️

A lightweight implementation of Dr. Fill

A simple and intuitive Chess AI in Python.

Chess Engine (Java)

AI-lab assignments