GitHub / HxnDev / Solving-8-Puzzle-Problem-in-Fixed-Moves
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.
Stars: 5
Forks: 0
Open issues: 0
License: mit
Language: Python
Size: 69.3 KB
Dependencies parsed at: Pending
Created at: almost 4 years ago
Updated at: almost 2 years ago
Pushed at: almost 4 years ago
Last synced at: 28 days ago
Topics: 8-puzzle, 8-puzzle-game, 8-puzzle-problem, 8-puzzle-solver, 8puzzle-game, bfs, breadth-first-search, code, fixed, fixed-moves, github, moves, python