An algorithm for solving 3 by 3 sliding puzzle in python
The program uses breath first search to find the optimal solution to the 3 by 3 sliding puzzle
First run setup.py to create two files adjList.npy and visited.npy Then run solver.py and input the scrambled puzzle into the program in flattened form. flattened form is the three layers of numbers concatenated together from top to bottom. The value of the empty position is 0.(i.e. The solved state in flattened form would be "123456780") The output will be a string of the numbers that need to be swapped with the empty space in order, so that the puzzle will be solved