Lt-UnReaL
Veteran
Did you try running it from a command-line? If you just dubbelclick in Windows it will show you a dos-like application for a fraction of a second only.
Hah, that was obvious, stupid me.
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.
Did you try running it from a command-line? If you just dubbelclick in Windows it will show you a dos-like application for a fraction of a second only.
Because the algorithms that were chosen are so easy and fast, the overal time could be pretty close to a system with 57 different algorithms.
I have a version that should run on Linux/Mac OS X, if anyone needs it.
To find out how much time you will loose this way, just compare the best cases (equal) and the worst cases (worst regular OLL, worst "3rd gen OLL") and measure the time it takes you. The real difference will be about halfway.
So let's say that the worst regular OLL takes 3 seconds and the worst "3rd gen" OLL takes 5 seconds. Than you will loose about 1 second on average.
that won't necessarily give anything away though. the worst oll case could be much worse than the rest, or conversely, the worst 3rd-gen oll case could be about the same as others. testing just the endpoints won't give any information about the other 55 cases aside from the min/max cases
but yes i'm pretty interested in this. i've already done some simple stuff for the cases when all edges are oriented just by experience (so i'd know for example that if i have a "car" then face it towards me, and do sune+antisune)
also, i have a question regarding 2look OLL. i've been told for a true 2look, you'd need to know the 2 edge algs and the 7 corner algs, right? but what if you get a case where the edges cannot be solved in one alg. doesn't that make it a 3look? or do the 7 corner algs include these 2 cases, in which case it's really a 1-2look?
sorry if that sounded confusing ;P