15-puzzle game in typescript with algorithmic solver.
-
Updated
Sep 23, 2021 - TypeScript
15-puzzle game in typescript with algorithmic solver.
A C++ project which efficiently solves any given N-puzzle using backtracking on a decision tree.
Python code to solve a 15 number puzzle using breadth-first-search algorithm.
Explore A* search for solving 3x3 and 4x4 puzzles
Some basic Ai algorithms used to solve 15 puzzle game
The 15 Puzzle is a sliding puzzle that consists of a 4 by 4 frame of numbered square tiles in an arbitrary ordering with one space. The objective of the puzzle is to place the tiles in ascending order, by making sliding moves that use the empty space.
Implementing A-star(A*) to solve 15-Puzzle game in OCaml
This repository is made to fulfill Tugas Kecil 3 Strategi Algoritma 2022
Solve a sliding 15-puzzle using different search strategies.
8-15Puzzle Solver A* (Manhattan Distance)
Greedy Algorithm (AI)
📈 Welcome to the Design and Analysis of Algorithms Repository! 📚✨ Immerse yourself in a meticulously curated knowledge pool on algorithmic design and analysis. 🌐💡 Explore the intricacies of crafting efficient algorithms and navigating problem-solving strategies. 🚀🔍 Master the art of algorithmic exploration in this dynamic space! 👨💻🧮
A python program to solve 15-puzzles using branch and bound algorithm.
Rust software for solving combination puzzles.
🧩 Prolog solver for the 15 puzzle problem
8 puzzle and 15 puzzle game using Backtracking algorithm
A puzzle solver that is written using the Dart language and the principles of OOP and Solid
Puzzle solver is a Java app which implements A* algorithm for numeric puzzles.
Add a description, image, and links to the 15-puzzle-solver topic page so that developers can more easily learn about it.
To associate your repository with the 15-puzzle-solver topic, visit your repo's landing page and select "manage topics."