OLL skip method?

[Johannes91]

This is actually a really trivial case, because permutation doesn't change. Something like this would do (in Perl):

@foo = qw(? +? -?);
for $a (@foo) { for $b (@foo) { for $c (@foo) {
    print "~U ? ? FR ? ! ! ! ! ? !! RFD $a $b $c @? !!\n" } } }

Or functionally:

@foo = qw(? +? -?); sub _;
sub _ { if (@_ - 3) { _ @_, $_ for @foo }
        else { print "~U ? ? FR ? ! ! ! ! ? !! RFD @_ @? !!\n" } }
_ $_ for @foo

In general, just loop or use recursion to visit all positions. If you're not ignoring any pieces, then you have to deal with parities, but it's not a big deal.

 

[gillesvdp]

Oh ok.
Could I do it using Python ?
That's the only language in which I have very little knowledge.

 

[Lt-UnReaL]

I downloaded Perl 5.8.8. How do I install it now? xD

 

[Johannes91]

Python is a very nice language, surely you can use it for this. But you can also just email me when you need input lines for ACube and I'll generate them. I've done it so many times already that it's easy.

I downloaded Perl 5.8.8. How do I install it now? xD

You're using Windows? I don't know, I only use Linux. It's sooo much better for hackers. But you'll probably find instructions if you google for it.

 

[Karthik]

How do I make Cube Explorer generate the solutions to all the 1000+ LL cases??

 

[ExoCorsair]

I downloaded Perl 5.8.8. How do I install it now? xD

I run ActivePerl, from ActiveState (run a quick Google search, and run it with Komodo (also from ActiveState).

 

[gillesvdp]

I just found my "Cube Book" in which I write various stuff about the cube, including algorithms I find (or have found by ACube) back.

And the "Pull-Right" algorithms are already in it so I will start making the webpage right now and finish it soon.

Here is the address: http://www.gillesvdp.com/cube/docs/oll_skip/

 

[Lt-UnReaL]

I was thinking, how much time would this actually save? With a skip, you do the F2L case, and before you put in the pair, you gotta recognize and execute an alg to skip OLL. Without a skip, you do the F2L case, and then recognize and execute an alg to do OLL. They are both 2 looks, so does the skip method really only save 3 moves? (Actually maybe 5 moves since the algs are a bit shorter)