Python script for solving the classic "8-puzzle" game
-
Updated
Jun 23, 2015 - Python
Python script for solving the classic "8-puzzle" game
8-Puzzle solver
This application allows you to view a representation of a range of different graph search algorithms, whilst solving your choice of 8-puzzle problems.
Implementation of the 8-Puzzle problem using A* Search Algorithm
A* and IDA* algorithms on 8-Puzzle
8-Puzzle solver using A* Search with the manhattan & hamming heuristic
This repository contains solver to 8 Puzzle Problem using A* algorithm and manhattan distance as heuristics.
This app built by modularization of controller, data, algorithm and UI. An 8 Puzzle Solver using brute force search algorithm written in Python and used PyQt5 library for UI.
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.
Explore A* search for solving 3x3 and 4x4 puzzles
Solving 8-puzzle problem with search algorithms
Finding optimal solution to a given configuration of the 8 puzzle problem
Implemented the 8 puzzle problem using DFS, BFS in python
8 puzzle solver using BFS, DFS, IDDFS and A-star algorithm
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.
Repository for the 8-puzzle problem solving project for the Artificial Intelligence discipline of the Computer Science course at the University of Lavras
Using heuristic search Best-First and A* with BFS (with manhatan distance) methods to solve 8-puzzle
8 puzzle and 15 puzzle game using Backtracking algorithm
Add a description, image, and links to the 8-puzzle-solver topic page so that developers can more easily learn about it.
To associate your repository with the 8-puzzle-solver topic, visit your repo's landing page and select "manage topics."