A* written in C#, used with LINQ.

This repository contains implementation of different AI algorithms, based on the 4th edition of amazing AI Book, Artificial Intelligence A Modern Approach

A strong chess engine made in c++

Solve the Fifteen Puzzle optimally with IDA* using different heuristics.

Swift implementation of the Sliding Puzzle game with Iterative Deepening A* AI Solver.

BFS, IDS, Greedy & A* applied to the 8-puzzle problem. ⚙️

Different Searching algorithms (DFS, BFS, IDS, Greedy, A*) opting to find optimal path from source to destination

A simple chess engine written in C and parallelized using OpenMP

Visualization for multiple searching algorithms.

Eclipse RCP chess app with an AI based on alpha-beta pruning & iterative deepening.

Python program that solves the Missionaries and Cannibals problem, a toy problem in AI, with iterative deepening search.

👁‍🗨🧠 Artificial Intelligence search project implementing IDS, Bidirectional BFS and A*.

A superhuman chess engine written in Java.

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

A terminal implementation of the game Quoridor with an engine

A servant robot trying to serve as fast as possible using A* algorithm.

DFS / BFS / IDS / UCS / Bi-directional / A* / IDA* / SMA* / ...

My projects/labs for Udacity Artificial Intelligence Nanodegree (April 2017 - present).

This is an Artificial Intelligence project which solves the 8-Puzzle problem using different Artificial Intelligence algorithms techniques like Uninformed-BFS, Uninformed-Iterative Deepening, Informed-Greedy Best First, Informed-A* and Beyond Classical search-Steepest hill climbing.