Poznań Open 09, Poznań's second championships, will be held on 27th-28th of June, 2009, in Poznań. Expect 13 official events + bunch of unofficial, including knock-out ('tournament') and team solving.
Foreign competitors especially welcomed. I can assist in all the...
Actually it's implemented this way ;) (with some hacks to eliminate these symmetric/rotated cases caused by the lack of centers).
The code is completely generic (so it could be used with any puzzle; well, to be honest, using it with square-1 would require some readjustments).
The only drawback...
Matthew's actually got all ZBLL cases (with corresponding solutions, of course) stored in his private database, so it's a matter of a few queries to compute these statistics ;)
PS. 'Tricontinental' sounds absolutely awesome for me ;)
I think the subject is self-explanatory: recently I've been working on specialized application for generating 2x2x2 algorithms.
To be more specific, is not a program, but a programming library, on top of which you can build your own solvers for a particular system/method/case etc...
Can you prove that? How many cross-OLLs are there in COLL?
Actually it's rather simple, provided you can recognize COLL on the fly.
Check out Jason Baum's excellent article: http://jmbaum.110mb.com/zbll.htm
There are 84 2GLL situations, unless I've messed up the calculation. (12 cases for each cross-OLL case).
As far as my experience goes, 2GLL cases are as easy to recognize as ordinary ZBLL.
What's more: they're fast like nobody's business (extremely finger shortcut-friendly). Way faster on...
That sounds pretty neat.
In my opinion, however, how much value is added there in comparison with ZZ.b? If I understand it correctly, you're basically doing 'corner orientation' phasing-esque step (as opposed to 'edge permutation' phasing in ZZ.b). Then comes an 1LLL. (yeah, there's quite...