There are 7 repositories under 8-puzzle topic.
A* written in C#, used with LINQ.
A web-app that can solve 8-puzzle and visualize the search tree
Solve, test and benchmark algorithms for N-Puzzle problem with Python
BFS, IDS, Greedy & A* applied to the 8-puzzle problem. :gear:
this a python BFS , A* and RBFS implementation of 8 puzzle
A BFS and A* implementation to the classic 8-puzzle problem
Solutions to the classic 8 puzzle, implementing an A* best search algorithm to complete the puzzle in multiple languages.
This repository contains generic platform for solving and benchmarking computational puzzles using different search strategies
An implementation for 8 Puzzle problem with DFS, BFS, A Start, BDS, RBFS
NxM puzzle solver using graph traversal algorithms
8-puzzle solver. A*, RBFS, IDS algorithms, different puzzle sizes.
Using heuristic search Best-First and A* with BFS (with manhatan distance) methods to solve 8-puzzle
N-Puzzle implementation with BFS, DFS, Greedy and A*
A C++ implementation of N Puzzle problem using A Star Search with heuristics of Manhattan Distance, Hamming Distance & Linear Conflicts
A sliding puzzle game and solver using ncurses.
8-puzzle game that features a walkthrough of the optimal solution and allows users to customize the tiles using photos from their Gallery
This is an Artificial Intelligence project which solves the 8-Puzzle problem using different Artificial Intelligence algorithms techniques like Uninformed-BFS, Uninformed-Iterative Deepening, Informed-Greedy Best First, Informed-A* and Beyond Classical search-Steepest hill climbing.
Implemented the 8 puzzle problem using DFS, BFS in python
8 Puzzle solver using uninformed and informed search algorithms as DFS, BFS and A*.
An 8-puzzle game solver implementation in Python, uses informed and uninformed search algorithms and is extensible to be used on an N-Puzzle game.
The 8-puzzle problem is a puzzle invented and popularized by Noyes Palmer Chapman in the 1870s. It is played on a 3-by-3 grid with 8 square blocks labeled 1 through 8 and a blank square. Your goal is to rearrange the blocks so that they are in order.
🕹 Algoritmo que resolve o jogo dos oito por busca em profundidade(sem estados visitados), busca em largura(com estados visitados), busca gulosa(com estados visitados) e busca a*(com estados visitados). Podendo mostrar passo a passo das escolhas dos nós e mostrando a árvore resultante(até um certo limite ou completa) do método de busca selecionado.
Using breadth-first-search, depth-first-search, A* algorithm to solve 8-puzzle-problem and missionaries-cannibals-problem
Classic n-puzzle problem solver using A* search
A sliding block puzzle, whose solution is found using A* Search.
A command line utility used to solve the 8-puzzle game. It is written to demonstrate the A* Search algorithm and using heuristics to find a goal state.
Solver for the 8-puzzle problem using the following algorithms: BestFS (using Manhattan's distance as a heuristic function) , DFS and BFS.
Algorithms I solutions http://algs4.cs.princeton.edu/code/
Also known as 8-puzzle or 15-puzzle using A* algorithm
Python codes for A* algo, RBFS algo and IDS algo on 8_PUZZLES problem.