8 puzzle problem with BFS

Project Description

BFS is an algorithm for traversing or searching tree of graph data structures. Hence, it can be used to solve 8 puzzle problem and this repository implements BFS to solve the 8 puzzle problem.

Programming Language and libraries

• Language:- Python
• Libraries:- anytree, numpy

Result and screenshots

Running the program

1. python 8_Puzzle_Bfs.py 1,2,0,4,5,3,7,8,6 > output.txt

2. Output will be generated in output.txt file in your working directory