This project solves the classical eightpuzzle problem using a search approach.
The project is divided into 4 packages
- search: library to solve generic search problems. It uses a generics approach to easily implement domain-specific states and transitions. Current version only includes breadth-first and best-first search algorithms
- task: utility library to ease the creation and execution of search tasks
- util: various utilities
- eightpuzzle: implementation of the eightpuzzle solver by definining specific states, actions and heuristics