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. ⚙️

this a python BFS , A* and RBFS implementation of 8 puzzle

8 puzzle solver using BFS, DFS, IDDFS and A-star algorithm

A BFS and A* implementation to the classic 8-puzzle problem

Java program to solve the 8 puzzle problem using branch and bound algorithm.

Solutions to the classic 8 puzzle, implementing an A* best search algorithm to complete the puzzle in multiple languages.

8-puzzle game is a sliding puzzle that consists of a frame of numbered square tiles in random order with one tile missing

This repository contains generic platform for solving and benchmarking computational puzzles using different search strategies

NxM puzzle solver using graph traversal algorithms

Using heuristic search Best-First and A* with BFS (with manhatan distance) methods to solve 8-puzzle

An implementation for 8 Puzzle problem with DFS, BFS, A Start, BDS, RBFS

N-Puzzle implementation with BFS, DFS, Greedy and A*

8-puzzle solver. A*, RBFS, IDS algorithms, different puzzle sizes.

8-puzzle game that features a walkthrough of the optimal solution and allows users to customize the tiles using photos from their Gallery

A C++ implementation of N Puzzle problem using A Star Search with heuristics of Manhattan Distance, Hamming Distance & Linear Conflicts

Implemented the 8 puzzle problem using DFS, BFS in python

A sliding puzzle game and solver using ncurses.