This is a solution to a coding assignment that involves solving a jigsaw puzzle. This solution will use python and might explore a number of graph traversal Algorithms such as Backtracking (brute force), Breadth-First Search (BFS) and Depth-First Search (DFS) Algorithms to create a puzzle_solver() program.
Visit - PuzzleSolver Algorithm
Please visit the link above and wait for the docker image to be deployed to the appropriate server provided by mybinder.org. When the notebook is ready, double click on puzzleSolver.ipynb to have a real time interaction with the notebook.
Sulaymon Tajudeen
- Python
- Jupyter notebook
- mybinder.org
- Git and GitHub
- Docker
After the notebook has finished loading, follow the steps below to run the notebook:
- Click
Kernelbutton above - Select
Restart & Run Allto see the output of each cell all at once - Select
Restart and Clear outputto clear the output of all the cells at once - In case you run a cell individually, make sure you run all the cells above it that contains variables reference in that particular cell.
- Implement a valid solution that return expected result. The current result do not match the expected result
- Handle different edge cases mentioned in the document as part of the code implementation
- Build different test cases for the highlighted edge cases mentioned on the document
- Implement Depth-First Search Algorithm for the same problem
- Implement Bread-First Search Algorithm for the same problem
- If possible, implement A* Algorithm for the same problem