Eight Puzzle solver using BFS, DFS & A* search algorithms
-
Updated
May 8, 2020 - Java
Eight Puzzle solver using BFS, DFS & A* search algorithms
A fully recursive algorithm to solve eight queens' problem
A eight puzzle game auto-solver with QT GUI
project of intro2ai class, eight puzzle problem
Solver for the Eight Puzzle Game
A simple console application that solves the eight puzzle game using different types of heuristics.
Advanced Programming Assignment about components and event-based communication mechanisms with Java Beans
Python program to solve eight puzzle problem
Eight queens puzzle in C++
Solves Eight Puzzle using Breadth first algorithm
solving 8_puzzle in 3 method: breadth first search , depth first search and A*
Implementing a steepest-ascent/-descent hill-climbing algorithm and A* algorithm to solve the 8-puzzle problem.
Heuristic-based solution for the eight-puzzle game
8Puzzle Solver In Java!
Comprehensive suite for solving and analyzing the Eight Puzzle problem using classic and informed search algorithms, with benchmarking, heuristics, and reporting tools.
This repository contains solver to 8 Puzzle Problem using A* algorithm and manhattan distance as heuristics.
This repo contains all the Assignment given in CS571 course.
Add a description, image, and links to the eight-puzzle-game topic page so that developers can more easily learn about it.
To associate your repository with the eight-puzzle-game topic, visit your repo's landing page and select "manage topics."