♟️ Athena is a Python-based chess engine using negamax algorithm with alpha-beta pruning, piece-square tables, Simplified Evaluation Function and move ordering♟️
-
Updated
Apr 8, 2024 - HTML
♟️ Athena is a Python-based chess engine using negamax algorithm with alpha-beta pruning, piece-square tables, Simplified Evaluation Function and move ordering♟️
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"
Portfolio of AI projects developed during my Udacity AI Nanodegree, covering Planning AI, Constraint Satisfaction, Hidden Markov Models, and Search algorithms.
A lightweight implementation of Dr. Fill
A simple and intuitive Chess AI in Python.
AI-lab assignments
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.
Add a description, image, and links to the alpha-beta-pruning topic page so that developers can more easily learn about it.
To associate your repository with the alpha-beta-pruning topic, visit your repo's landing page and select "manage topics."