Raj Prakash Shinde- 116852104- https://github.com/RajPShinde/
This is a code to solve 8 Puzzle Problem using BFS(Breadth First Search) Algorithm.
The code solves any given state of a 8 Puzzle problem to reach the goal state of 1 2 3 4 5 6 7 8 0. The data structure used in this code is a list, which is used to store all the node information. The code also stores the required states to reach the goal in nodePath.txt, all explored nodes in Nodes.txt and the node info in NodesInfo.txt. The maximum time required to solve can be upto 1hr 30mins
- python 3
1.Unzip the folder
2.Run the python code 8_puzzle_bfs.py in Spyder
OR
3.Open a terminal in folder containing code and type 'python 8_puzzle_bfs.py'
4.After running, Enter a start node row wise (e.g 1 2 3 0 4 5 8 6 7) as specified in terminal/Console
5.Wait till the action set and path is displayed (may take 1 hr 30 mins)
6.text files will be generated in the same folder as the code
1.BlankTileLocation(N)- Used to find the Location of a blank tile in the node
2.ActionMoveUp(b,N)- Used to move the blank tile Up
3.ActionMoveDown(b,N)- Used to move the blank tile Down
4.ActionMoveLeft(b,N)- Used to move the blank tile Left
5.ActionMoveRight(b,N)- Used to move the blank tile Right
6.generate_path(path,N)- Used to generate node path after goal node is reached
7.AddNode(P,Pf,iteration,child,j)- Performs the Up, Down, Left, Right Operations on Parent node
8.column(N)- Converts a node into coloumn wise string
9.run(N)- Runs the flow for BFS Algorithm
1.https://www.w3schools.com/python/python_lists.asp
2.https://massivealgorithms.blogspot.com/2015/06/how-to-check-if-instance-of-8-puzzle-is.html