NxM puzzle solver using graph traversal algorithms
-
Updated
Jun 4, 2021 - Java
NxM puzzle solver using graph traversal algorithms
🎮 Classic Android Puzzle Game to reorder 15 tiles in ascending order
Android app that uses CNN and IDA* algorithms to detect and solve 15-Puzzles
A sliding puzzle game & AI solvers
Program utilizing an A* algorithm with various heuristics to solve nxn sliding puzzles. Outputting the steps required to solve the puzzle into txt files.
🎮 Игра в 15.
Puzzle solver is a Java app which implements A* algorithm for numeric puzzles.
Solve the 15 Puzzle with different algorithms
This Repository contains a solver for fifteen-puzzle To be specific, the NxN sliding puzzle solver in JAVA. The program uses a specific version of Kruskal Algorithm mainly known by A* algorithm with three different heuristics. It uses greedy version of the A* algorithm along side of different heuristics in order to achieve faster solutions
AI Lab Offlines and Onlines
Solving the 15-Puzzle sliding game with informed search algorithms and various heuristics.
1º Trabalho Prático de Inteligência Artificial FCUP - 2016/2017
Add a description, image, and links to the 15-puzzle topic page so that developers can more easily learn about it.
To associate your repository with the 15-puzzle topic, visit your repo's landing page and select "manage topics."