LucasSousa
Member
- Joined
- Dec 28, 2014
- Messages
- 6
Hello guys,
I'm here to share with you this cool tool I made with my friend Anuar Onofre to easly find and generate easy and fast PBL algorithms.
The idea came from a Jayden McNeill's facebook post and is use two other short sequences combined to solve a PBL. Then the program will test which combinations of two sequences solves the selected PLLs. Take in mind that, once advanced solves don't uses parity more (CSP removes it) this was developed to search only for non-parity cases.
After you select PLLs from lists (used main Raùl PLLs list as reference) you can click "find". After some seconds your solutions will be showed in the output panel with some other useful info about searching.
You can find more information about program in the description of this demo video, and the download link as well:
Also you can follow current project development repository on GitHub. Feel free to send any suggestions!
https://github.com/LucasAlfare/Square-1-PBL-Finder
I'm here to share with you this cool tool I made with my friend Anuar Onofre to easly find and generate easy and fast PBL algorithms.
The idea came from a Jayden McNeill's facebook post and is use two other short sequences combined to solve a PBL. Then the program will test which combinations of two sequences solves the selected PLLs. Take in mind that, once advanced solves don't uses parity more (CSP removes it) this was developed to search only for non-parity cases.
After you select PLLs from lists (used main Raùl PLLs list as reference) you can click "find". After some seconds your solutions will be showed in the output panel with some other useful info about searching.
You can find more information about program in the description of this demo video, and the download link as well:
Also you can follow current project development repository on GitHub. Feel free to send any suggestions!
https://github.com/LucasAlfare/Square-1-PBL-Finder