NxM puzzle solver using graph traversal algorithms

modern mathematical graph/network library written in PHP

Lab assignments and a final project for course DD2410 "Introduction to Robotics" at KTH University.

Anytime Guaranteed Search with Spanning Trees

A search engine using a simplified version of Google's page rank algorithm

Code implementation of course mini-projects.

Porjects for Algorithmic Techniques for Artificial Intelligence

Planning algorithms - BFS, DFS, Dijkstra’s, and A* implemented on a grid world environment of configurable obstacle density

Implementation of several algorithms on graphs, such as traversal, finding shortest paths, finding the minimum spanning tree and solving travelling salesman problem.

SkyRoute is a graph search program using depth first search and breadth first search in order to determine the fastest route from a landmark(mapped to closest train station) to another.Please note all the files are annotated making it easier to understand

FIDDLE (Finding Interactions using Diagram Driven modeL Extension) is a tool to automatically assemble or extend models with the knowledge extracted from published literature. The two main methods developed as part of FIDDLE are called Breadth First Addition (BFA) and Depth First Addition (DFA), and they are based on network search algorithms.

This project solves a 15 puzzle board from an input file using A star graph search

Algorithm practice with C++

Bachelor Thesis - Implementation of LexDFS algorithm on chordal graphs

I compared two graph search algorithms, the breadth-first search algorithm and the A* search algorithm.

📚 — Implementation of the breadth-first search (BFS) algorithm for solving the 15-puzzle problem, with performance analysis based on execution time and number of states explored.

Artificial Intelligence basic concepts: CSP problems, Graph search problems, Evolutionary Computation, Genetic algorithms and more to be added soon!