Sliding puzzle solution checker.
This modular program uses an algorithm that relies on various mathematical proofs in order to deduce whether any square sliding puzzle is solvable or not. Furthermore, when its solvable it provides you with a lower boundary of the minimum required moves in order to solve the puzzle.
Installing / Getting started
Python Interpreter 3+ is required in order to compile the code, you may build this into an executable through other means if you wish. Standard compilation is all that is needed.
python sliding_puzzle_main.pyOnce the code is executed, follow the instructions on the screen.
Developing
git clone https://github.com/faycalki/sliding_puzzle_checker.gitFeatures
- Efficiently computes whether the square array is solvable or not;
- Minimal dependencies;
- Can be implemented as a fully modular program with minimal editing.
- Provides you with a lower boundary minimum number of moves to solve the puzzle (when its solvable).
Contributing
If you'd like to contribute, please fork the repository and use a feature branch. Pull requests are warmly welcome.
Links
- Repository: https://github.com/faycalki/sliding_puzzle_checker/
- Issue tracker: https://github.com/faycalki/sliding_puzzle_checker/issues/
- In case of sensitive bugs like security vulnerabilities, please contact icechillgaming@gmail.com directly instead of using the issue tracker. I greatly appreciate any efforts to improve the security of my projects.
- My other projects, feel free to check them out: https://github.com/faycalki/
Licensing
The code in this project is licensed under the GNU General Public License v3.0.
Disclaimer
This project is intended to be used for legal purposes only, and is pursuant to the license terms and conditions provided.