What software do we need?

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.
 
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.

We had the same idea :p

http://dl.dropbox.com/u/17026863/translator/src/page.html
(not a permanent home btw, I'll delete it when I decide on a better place)

Source if anyone's interested/wants to add anything, it's still pretty primitive in terms of features/appearance/bugginess.
 
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?

For bigger cubes (5x5 and up iirc) the scrambles are just random move scrambles. 4,3,2,pyra,sq1 and clock (iirc) are random state, which means the state is found and the scramble is the inverse of that state. I don't know how it works though.
 
One thing that would be very simple: A site where you can put in a (my)SQL query and run it on the WCA database. I can't get BigDump to work with phpmyadmin, so I haven't been able to run queries on it
 
An alg generator with a simple user interface. I.e, highlight what you want to swap, and what you want to preserve.
I think it would probably be fairly easy to make a graphical interface to Acube that could do this, no?
Wasn't stachu supposed to be making one of those anyway? >_>
 
There are many 2SidePLL recognition systems. How bout one for CMLL?

d8b.png

I'll look into it.

I think it would probably be fairly easy to make a graphical interface to Acube that could do this, no?
Wasn't stachu supposed to be making one of those anyway? >_>

Ya gripper =[
All in good time he says.
 
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.
 
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 :P
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...
 
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.

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 :P
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 don't think it's exactly what you're looking for, but perhaps you'd be interested in looking at Stefan Pochmann's Hume?
 
Back
Top