https://github.com/yusufceylan/8-puzzle-problem
Python Implementation of 8 Puzzle Problem
https://github.com/yusufceylan/8-puzzle-problem
Last synced: 3 months ago
JSON representation
Python Implementation of 8 Puzzle Problem
- Host: GitHub
- URL: https://github.com/yusufceylan/8-puzzle-problem
- Owner: yusufceylan
- Created: 2016-06-18T11:54:42.000Z (almost 9 years ago)
- Default Branch: master
- Last Pushed: 2016-06-18T12:10:43.000Z (almost 9 years ago)
- Last Synced: 2025-01-03T21:14:28.536Z (5 months ago)
- Language: Python
- Size: 2.93 KB
- Stars: 1
- Watchers: 2
- Forks: 2
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
## 8-Puzzle-Problem
Python Implementation of 8 Puzzle Problem
The 8-puzzle is a smaller version of the slightly better known 15-puzzle. The puzzle consists of an area divided into a grid, 3 by 3 for the 8-puzzle, 4 by 4 for the 15-puzzle. On each grid square is a tile, expect for one square which remains empty. Thus, there are eight tiles in the 8-puzzle and 15 tiles in the 15-puzzle. A tile that is next to the empty grid square can be moved into the empty space, leaving its previous position empty in turn. Tiles are numbered, 1 thru 8 for the 8-puzzle, so that each tile can be uniquely identified.
The aim of the puzzle is to achieve a given configuration of tiles from a given (different) configuration by sliding the individual tiles around the grid as described above.
You can visit [Wiki Page](https://en.wikipedia.org/wiki/15_puzzle) for more information