https://github.com/ispobock/n_puzzle

BFS & A* algorithm to solve N_puzzle problem
https://github.com/ispobock/n_puzzle

astar bfs npuzzle python3

Last synced: 8 days ago
JSON representation

BFS & A* algorithm to solve N_puzzle problem

• Host: GitHub
• URL: https://github.com/ispobock/n_puzzle
• Owner: ispobock
• License: mit
• Created: 2020-10-12T07:41:19.000Z (about 4 years ago)
• Default Branch: master
• Last Pushed: 2021-10-24T16:20:23.000Z (about 3 years ago)
• Last Synced: 2024-11-30T12:21:49.219Z (about 1 month ago)
• Topics: astar, bfs, npuzzle, python3
• Language: Python
• Homepage:
• Size: 9.77 KB
• Stars: 0
• Watchers: 2
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

        
# N_puzzle

Two algorithms to solve [N_puzzle problem](https://en.wikipedia.org/wiki/15_puzzle).

![8-puzzle-example](./figs/8-puzzle.png)

## Requirements

- Python3

## Algorithms

- BFS (Breadth-first search)

    - Can find an optimal solution, but time-consuming.

- A* algorithm

    - An efficient heuristic algorithm.

    - Cost function：`steps_from_start + manhattan_distance_to_goal`