A* written in C#, used with LINQ.
-
Updated
Mar 29, 2019 - C#
A* written in C#, used with LINQ.
A web-app that can solve 8-puzzle and visualize the search tree
BFS, IDS, Greedy & A* applied to the 8-puzzle problem. ⚙️
Solve, test and benchmark algorithms for N-Puzzle problem with Python
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
N-Puzzle implementation with BFS, DFS, Greedy and A*
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
A sliding puzzle game and solver using ncurses.
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.
Add a description, image, and links to the 8-puzzle topic page so that developers can more easily learn about it.
To associate your repository with the 8-puzzle topic, visit your repo's landing page and select "manage topics."