Solves sliding puzzles. According to specifications from Artificial Intelligence Lab01.
Puzzles for Part I.
Progress as of 3/8/2020.
Improvements: Workable BFS/DFS search function (altered by .popleft() or .pop()) and returns correct paths. Both searches done in reasonable time (2-3 seconds for 3x3 puzzles). Implements global directory.
Problems: Output paths do not match solutions. BFS returns shorter-than-expected paths while DFS returns (far-)longer-than-expected paths.
Progress as of 3/15/2020.
Fully successful BFS implementation.