rvnandwani / enpm661-p1-8-puzzle-implementation-using-brute-force-search Goto Github PK
View Code? Open in Web Editor NEWThe project was about to find all the possible states of the 8-Puzzle starting from the given initial state, keeping in mind, the states should be unique (no repetitions). After that use the brute force search algorithm (BFS) to find the path to reach the goal state using the possible states of 8-puzzle.