The Sudoko Solver solves a given Sudoku using a selection of different algorithms. This project was built with the main purpose of implementing some algorithms for academic purposes.
This project was built to solve Sudoku's using different algorithms. The main reason is that i like Sudoku and find it interesting to use algorithms to solve the problem. The algorithms that I used in this project resulted from some research in books and websites. I decided to record th execution times of the different algorithms to have a slight ideia of which is the fastest. It is importatnt to note that the measured times are not very representative of the real execution times because the machines were the program runs usually have programs running in background. For testing purposes there is a Batch Mode to run multiple tests that calculates the average execution time of each algorithm.
The algorithms used so far include:
- Backtracking Algorithm
- Dancing Links Algorithm (next iteration)
To get started all you need to do is to is to clone the repository and compile the project.
The only prerequisite to run this program is to have Java installed in your machine.
To run the static example you just need to run the SudokuTester class.
For more information, please refer to the Documentation
Contributions are what make the open source community such an amazing place to be learn, inspire, and create. Any contributions you make are greatly appreciated.
- Fork the Project
- Create your Feature Branch (
git checkout -b feature/AmazingFeature) - Commit your Changes (
git commit -m 'Add some AmazingFeature') - Push to the Branch (
git push origin feature/AmazingFeature) - Open a Pull Request