DTU course 02180 Introduction to Artificial Intelligence, Spring 2024

Python implementation of common pathfinding algorithms in 3D grid space

Breadth-first search, Depth-first search, Best-first search,A-Star search and AVL Trees algorithms implemented in C

8-Puzzle Solver webapp it uses different search algorithms to solve the classic 8-puzzle problem.

A Python implementation and visualization of various pathfinding and graph search algorithms.

This is a Python project that uses Tkinter to develop the front end of the application and Python to implement AI searches. This has a cool graphical interface and visualization to make the project look aesthetic.

Implementation of UCS on Romania to find shortest distance from Arad to Bucharest based on best-first search algorithm. It uses a dictionary that stores current city mapped to (parent city, current best distance), and frontier is a priority queue to process nodes containing (node id, current city, priority value).

Search Algorithms Library

Implementation of the Best First/A* Algorithm and Breadth-first Search Algorithm for room and box manipulation. Efficient algorithms for solving room and box manipulation problems. Instructions are available in English and Spanish.

Solves a N-Dimension Puzzle with one of the 4 different path algorithms : Breadth 1st Search, Depth 1st Search, Best 1st Search and A* Search.

Deep search, Best-first Greedy search, Hill Climb

A CLI application for creating mazes using Eller's algorithm, solving them using the Best first search algorithm, and running various outputs.

This repository contains codes that demonstrate BFS and DFS traversals on the map of romania, using frontier and explored lists

C++ Implementation of Path Planning Algorithms based on the Python Implementation by Huiming Zhou (https://github.com/zhm-real)

Solving TACI 8-Puzzle using heuristic search

This repository demonstrates work completed as part of the University of St Andrews, CS5011 Artificial Intelligence Practice module. Specifically, four different AI practice domains were considered: Search, Uncertainty, Logic, and Learning.

Deliverables relating to the Fundamentals of Automated Planning University Unit

Project for IA Subject where we study Geographics Networks and Search Algorithms