Given the size n, initial state, and search method, you can solve a sliding puzzle through the use of BFS, DFS, GBFS, and/or AStar.
-
Updated
Nov 14, 2021 - Java
Given the size n, initial state, and search method, you can solve a sliding puzzle through the use of BFS, DFS, GBFS, and/or AStar.
Final project for AI class at the University of Florence. Solves 8 and 15 Puzzle.
Slinding puzzles - Check whether a directed graph is acyclic
Project 1: Use diameter to generate any M-by-N puzzles and a solver. Project 2: Use greedy search to find the related features of nearest neighbor
A sliding puzzle game & AI solvers
A sliding puzzle game for Android with deep learning techniques, written in Java and Python, utilized TensorFlow and Jupyter.
Use search algorithms to solve Sliding Block Puzzle
Usage of A*/Astar algorithm
NxM puzzle solver using graph traversal algorithms
Naive AI Aided Sliding Puzzle Game (picture-image-block-tile-maze-riddle)
A Java 11+ sliding puzzle game using the FXGL library
Add a description, image, and links to the sliding-puzzle-game topic page so that developers can more easily learn about it.
To associate your repository with the sliding-puzzle-game topic, visit your repo's landing page and select "manage topics."