A console based packman game in C using A star algorithm.
-
Updated
Jul 21, 2020 - C
A console based packman game in C using A star algorithm.
Solving Stage Puzzles: Text UI
3 part project: A. bottleneck autoencoder, B. manhattan distance, C. earth mover's distance
8-Puzzle solver implemented using search algorithms: DFS, BFS, A-Star (Manhattan and Euclidean heuristics) with GUI for user interactivity
Classification of IRIS Dataset using various distance metrics.
The classic 8-Puzzle challenge: Human vs. AI! This project features an AI solver (Best-First Search with Manhattan distance) and a Tkinter GUI that visualizes its steps. A volunteer can initialize the AI solver alongside a human's manual attempt. The "Stop" button allows the volunteer to declare the human the winner if they solve it before the AI.
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 C-based 8 puzzle solver using graphs and Abstract Data Types and 3 search-algorithms: DFS, BFS, Best-First with Manhattan Distance
Another implementation of the game 15 puzzle. But you can get a hint if you stuck.
This repository is used for "Computer Vision and Pattern Recognition" course work.
Solves the 8puzzle problem using A* algorithm
This project uses the K-Nearest Neighbors algorithm to classify individuals into gender categories based on their physical attributes. It assesses the model's performance across different configurations and feature sets.
C++ implementation of IDA* algorithm for solving the 15 and 25 puzzle
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.
Pacman diseñado con GUI minima para desarrollo de actividades de analisis de algoritmos (Dijkstra y A*)
k-Nearest Neighbors algorithm from scratch.
Implementing the kNN algorithm using python and comparing the Euclidean, Manhattan and Minkowski distances
Path Finding 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.
Computes a voronoi-diagram with manhattan-distance-metric using a simulation
Add a description, image, and links to the manhattan-distance topic page so that developers can more easily learn about it.
To associate your repository with the manhattan-distance topic, visit your repo's landing page and select "manage topics."