• Welcome to SpeedSolving.com — the world’s largest puzzle community!

    You’re currently browsing as a guest, which means you have limited access to discussions, resources, member profiles, and community features.

    Join 50,000+ cubers and puzzle enthusiasts from around the world to ask questions, share solves, improve faster, and be part of the community.

    Registration is free, fast, and easy — create your account today.

    Already a member? Log in here to hide this message and start participating.

Triangular Francisco Method Guide/Algorithms

Curious, what's the average move-count here? STM is preferred. :)
It's a fun method. :D

All the example solves I've done seem to be around 60, except that one where I used your CLS alg since there wasn't a good CSO one. I'm not done generating CSO yet, I keep generating more and changing old ones every day.
Unless there is some way to specifically find average move count, then I'd say around 60 using the tools I have.

Edit: Also, I didn't mention this earlier since I didn't want to bump the thread for it, but I generated the 1-look ESO algs for when both of the D layer edges are in the D layer but not correct.
 
Last edited:
is that just like the belt method

It's sort of like what Fridrich would be if you started with a triangle, used keyhole F2L, used CLS, then OL5E and finish with PLL.

Oh wait, that isn't very much like Fridrich at all. Just look at one of the example solves.

Edit: Also once ACube supports wide turns I'm going to redo all the CSO cases.
 
Finally got round to reading this thread and starting to learn this method, I managed to work out most of it just by trying to solve it various ways,

after a few solves i noticed some of the ESO cases are either missing or im just being stupid and not noticing something...?
whatever the case, the list is below and the cases i believe to exist are just left blank

Edge already in D layer but mis-orientated:
1000 M' U2 M U' M' U M
0111 M' U' M U M' U M U2 M' U' M

Edge in UF, orientated:
1111 M' U2 M
0111
1011 (U') M' U2 M U' M' U' M U2 M' U M
1101 (U') M' U' M U' M' U M
0001 (U2) M' (U'/U) M U2 M' U2 M
1001 M' U' M U2 M' U M
0101 (U) M' U M U' M' U M
0011

Edge in UF, mis-orientated:
0000 (U') M' U2 M U2 M' U M
1000 (U) M' U' M
0100 M' U' M U' M' U2 M
0010
1110 (U) M U M U2 M' U M'
0110
1010 (U2) M' U M U' M' U' M
1100 M' U M U M' U M U2 M' U' M

I would usually just come up with my own algorithms for cases as simple as this but ive tried and they end up just like Roux mooing, which cant be bad, but its not ideal

and lastly, sorry for reopening a potentially "dead" thread
 
Last edited by a moderator:
Back
Top