Digital Image Processing

Pacman diseñado con GUI minima para desarrollo de actividades de analisis de algoritmos (Dijkstra y A*)

Solving Stage Puzzles: Text UI

3 part project: A. bottleneck autoencoder, B. manhattan distance, C. earth mover's distance

O projeto foi um trabalho acadêmico de Inteligência artificial, tem como objetivo solucionar o problema 8-Puzzle. Confira o vídeo demonstrativo.

A console based packman game in C using A star algorithm.

Classification of IRIS Dataset using various distance metrics.

8-Puzzle solver implemented using search algorithms: DFS, BFS, A-Star (Manhattan and Euclidean heuristics) with GUI for user interactivity

In this repository, I have implemented Machine Learning algorithms, not just by using predefined libraries, but also from scratch by uncovering the underlying math and applied them on datasets.

C++ implementation of IDA* algorithm for solving the 15 and 25 puzzle

graph search using A star search algorithm in python3

Solves puzzles of various sizes

Algoritmos de busca em largura (BFS) e busca em profundidade (DFS) usando estrutura de dados de fila e pilha, respectivamente. Na branch "Manhatan-and-Euclidian-distance", temos o BFS usado para calcular a distância euclidiana e a distância de Manhattan.

This Java-based GUI program lets users generate and solve mazes. It employs the Depth-First Search (DFS) algorithm for maze generation and A* algorithm with Manhattan distance heuristic for solving. The program provides a visual representation of the maze, allowing users to visualize the process of maze creation and solving.

This repository is used for "Computer Vision and Pattern Recognition" course work.

Another implementation of the game 15 puzzle. But you can get a hint if you stuck.

Classic n-puzzle problem solver using A* search

Programa en ensamblador que calcula la distancia manhatan entre dos puntos + pruebas

A program to find solution of a given 24-puzzle problem for exercise by A* searching.

Various small projects covering a wide range of topics