--------------48922C30A9D6F72CEF00B48D
Content-Type: text/plain; charset=utf-8; format=flowed
Content-Transfer-Encoding: quoted-printable
That's pretty damn good, Mannessah! I expect you have your sights on sub 1 =
minute. I wish you had some competition.
-Melinda
On 9/5/2018 5:55 AM, timebug22@gmail.com [4D_Cubing] wrote:
>
>
> https://www.youtube.com/watch?v=3Du0Ixon0eS8I
>
> This solve beats the old record of 1:29.60
>
> turns - 106
>
> seconds - 85.97
>
> 106/85.97 =3D 1.2325~ TPS this might be the highest TPS gotten
>
> If I got above 1 TPS on the 3^4 ( I average 600 moves) then I could get u=
nder 10 minutes so it's a nice to know it's possible.
>
>
> method : Fourtega ( orientate the first cell, orient the=C2=A0last cell, =
permute the first cell, permute the last cell (OOPP?))
>
>
> First cell - meh, it wasn't that good a case but I solved it quick.
>
> OLC - 2-look, used a sune to solve for corners then solved the last to co=
rners wi th a conversion to this alg
>
> FR RO UO RO' UO' FR'
>
> PFC - Really lucky, accidentally used RKT for the first layer, then just =
parity to PLL skip.
>
> PLC - was fine except for a bad OLL , but no parity!
>
>
> I am gonna try learn Andrew Farkas' algorithms they would really make thi=
s a lot less luck based.
>
>
> -Mannessah Kani
>
--------------48922C30A9D6F72CEF00B48D
Content-Type: text/html; charset=utf-8
Content-Transfer-Encoding: quoted-printable
-8">
href=3D"https://www.youtube.com/watch?v=3Du0Ixon0eS8I"
moz-do-not-send=3D"true">https://www.youtube.com/watch?v=3Du0Ix=
on0eS8I
class=3D"yui-cursor">
This solve beats the old record of 1:29.60
turns - 106
seconds - 85.97
106/85.97 =3D 1.2325~ TPS this might be the highest TPS gotten
If I got above 1 TPS on the 3^4 ( I average 600 moves) then I
>
could get under 10 minutes so it's a nice to know it's possible.
method : Fourtega (
orientate the first cell, orient the=C2=A0last cell, permute the
first cell, permute the last cell (OOPP?))
First cell -=C2=A0
n
style=3D"word-spacing:normal;">meh, it wasn't that good a case
but I solved it quick.
OLC - 2-look, used a sune to
solve for corners then solved the last to corners wi th a
conversion to=C2=A0th=
is
alg
FR RO UO RO' UO' FR'=
p>
PFC - Really lucky, accidentally used RKT for the first layer,
then just parity to PLL skip.
PLC - was fine except for a bad OLL , but no parity!
I am gonna try learn Andrew Farkas' algorithms they would
really make this a lot less luck based.
-Mannessah Kani