PandaCuber
Veteran
There are many 2SidePLL recognition systems. How bout one for CMLL?
Follow along with the video below to see how to install our site as a web app on your home screen.
Note: This feature may not be available in some browsers.
I'm pretty sure thats the one he's referring to. It does take days for complex cases.
If you can share it that would be great. Thanks.I have made a program (for Windows only, lol). What features do you need from it? If it is needed, I can share it.
The 2x2 solver sounds pretty doable. It won't be amazingly optimized, but at a max of 11 moves that shouldn't matter too much
I'll take a crack at it.
Is there really a need to make a whole new solver for that?
The lazy way would be to just make an app where you can paste in the algs that you generated in another solver, and then just do transforms on them to output them with the various moves.
I don't know if this is possible/already done, but a cube-explorer type program that can work with any wca puzzle. Btw, how does the wca generator generate cases so quickly, even for big cubes?
I think it would probably be fairly easy to make a graphical interface to Acube that could do this, no?An alg generator with a simple user interface. I.e, highlight what you want to swap, and what you want to preserve.
Concerning the fate of Acube;
It's being ported to the .NET framework, and the code will be fully commented. If anyone cares to help, let me know. I'd highly appreciate it, as Josef's code is a bit crazily uncommented
The reason for this is simply because I don't know enough Java to do much work on Acube as is.
Please help, anyone? If anyone's up for it, I'll create a github .NET fork for the project.
EDIT; C#, not VB, for the .NET framework
For CMLL, you need to look at 3 sides. But that's easily possible.
What about Java? Do you understand a good bit of Josef's source?I'm fairly proficient at C# .NET, so if you set it up, I'll gladly have a go at it.
A method-interpreting solver. Information about the method and something like various abstractions and heuristics could be inputted by the user, along with algorithmic steps and approaches. The solver would be able to perform thousands of solves (not necessarily optimal), and then relay statistical data about cases arrived at, allowing the user to make certain generalisations about early stages of the solve and how they affect later stages, like last pair -> oll or cross -> f2l pairs. Being able to make +ev plays without having to learn thousands of specific cases and just look at generalisations would be amazing.
Basically, I want something to make Grand Unified Pair Selection Theory
On and off over the summer I've been trying to write a thread about pair selection in general and just can't organise my thoughts as well as I want, nor make any of the conclusions I think can be reached...
I imagine the hard part would be commenting the files... It shouldn't be too hard to just modify the code to work in .NET... but actually understand the code, that's something else altogether.https://github.com/StachuK1992/ACube
Here's the .NET github, if anyone wants to help. If you're up for it, just take a file and try to port it.
I'll look into it.
In any case, help is appreciated. I'm trying to sift through everything, and bugging Josef a bit..I imagine the hard part would be commenting the files... It shouldn't be too hard to just modify the code to work in .NET... but actually understand the code, that's something else altogether.