Digital Image Processing

Solution à l'exercice Power of Thor 2 proposé par la plateforme Codingame.

This will be some exercises that I will be performing using java

8-15Puzzle Solver A* (Manhattan Distance)

Eight Puzzle solver using BFS, DFS & A* search algorithms

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.

Maze is a mini project developed to generate a maze randomly and be capable to resolve it using A* algorithm and Manhattan or Pythagore heuristics.

Implementing the 8 puzzle program, manhattan distance algorithm is used to find best path and also a learned through experience heuristic algorithm.

This program lists all the paths with the same Manhattan distance from the king to the chess piece.

A Java console application that implements the factionality of the knn algorithm to find the similarity between a new user's location preferences and the locations. The binary data (0,1) are the location characteristics.

Solving the 15-Puzzle sliding game with informed search algorithms and various heuristics.

A java program that solves the Eight Puzzle problem using five different search algorithms.

A Java console application that implements the factionality of the knn algorithm to find the similarity between a new user with only a few non zero ratings of some locations, find the k nearest neighbors through similarity score and then predict the ratings of the new user for the non rated locations.

App that creates a shortest distance/path of all the items you want from the store

An efficient Nearest Neighbor Classifier for the MINST dataset. It uses a VP Tree data structure for preprocessing, thus improving query time complexity

Complete Java Approach