Esonero corso Modelli e Metodi dell'Intelligenza Artificiale

Solves three toy problems using state-space search

This contains my Java based implementations for uninformed search strategies which inlcude BFS, DFS and A* algorithm in AI Spring 2018 class.

artificial intelligence basics @ university of alcalá

Solution to three classic puzzles from the perspective of uninformed search. N-Queens, Lights Out and Linear Disk. Written in python 2.7

Implementation and comparison of most popular search algorithms.

This Python implementation is a scaled up version of the Missionaries and Cannibals problem with arbitary number of missionaries, cannibals and boat capacity

Here you will find resolved problems using artificial intelligence.

An Implementation of Blocks World problem with python. The blocks world is one of the most famous planning domains in artificial intelligence for more info (https://en.wikipedia.org/wiki/Blocks_world)

My solution to BW20019 assignment for Artificial Intelligence course in UoM.

Artificial Intelligence Laboratory Course A.A. 2018/19 University of Verona.

This is an educational repository containing implementation of some search algorithms in Artificial Intelligence.

Implementation of various Artificial Intelligence problems in java

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.

Solving Towers of Hanoi game using uninformed search algorithms. (B.Sc. course work)

Algoritmo para encontra la salida de un laberinto, dado un punto de inicio y algunos obstáculos, usando un algoritmo de búsqueda no informada de tipo "Búsqueda en profundidad" (DFS).

pacman solver with uninformed search algorithms in python

This program solves a 2D maze with the help of several search algorithms like BFS, DFS, A* (A-Star) etc.

This program solves 2D maze using various uninformed and informed (heuristic) search strategies.