I tried that, and I must have zigged instead of zagged. I had to resolve some centers, leaving me with this:
View attachment 3793
No clue how to proceed.
You can do what others suggested about reduction, but if you don't want to do that, then just use commutators as in the K4 Method (which assumes that you solve all layers except the last layer, complete all centers, and solve all corners before finally solving the last layer edges).
Here is a K4 solution to your exact case (with orange as the front face and yellow as the top face).
For Wing Edges
In fact, Thom Barlow (Kirjava) founded the K4 Method in 2006. His current website, specifically a page with all last layer algorithms for
wing edges (for which I got [r: [U2, l D2 l']] from in the solution above) is
here.
If you need a program to expand
commutators and
conjugates for cube sizes 2x2x2 through 7x7x7 in SiGN notation or WCA notation, and you have Microsoft Excel, I wrote a program that expands it for you. You can download it
here (and in that post, there are instructions on how to use).
For Middle Edges
For
middle edges, just use an alg like
F' R' U F' M' F U' R F' U M U' F2 to flip two adjacent middle edges, an alg like
M U' F R' U F' M' F U' R F' U to flip two opposite middle edges and combine either two to flip all 4.
+
F2 U M' U2 M U F2 (for clockwise 3-cycle called the "
Ub Perm" on the 3x3x3),
F2 U' M' U2 M U' F2 (for anticlockwise 3-cycle called the "
Ua Perm" on the 3x3x3),
M2 U M2 U2 M2 U2 U' M2 (for the 2 2-cycle called "
H Perm" on the 3x3x3),
and
M2 U' M2 F2 M2 F2 U M2 (for the 2 2-cycle called "
Z Perm on the 3x3x3).
By the way, if you are wondering what's the maximum number of short algorithms required to solve any given case of wing edges, Thom mentioned years ago that it is 3. If you want to learn to solve the last layer wing edges of any cube larger than the 3x3x3 with commutators with a step-by-step method, I created a 3 algorithm method to solve every possible case that can arise in every set (orbit) of wing edges.
, but on a 5x5 PLL (Permutation of last layer) and OLL (previously explained) don't exist,
Speaking of OLLs on the 5x5x5,
cuBerBruce figured out how to count the number of possible OLL cases on the nxnxn cube, and I made a formula from his algorithm. So there are 3799 OLL cases on the 5x5x5 (as opposed to only 57 on the 3x3x3)!
Here's a link to the number of OLLs for cube sizes from 2x2x2 to 20x20x20 (these numbers exclude the correctly oriented case, where all of the top layer is yellow), and
here is the thread I started which ultimately ended up with my explicit formula.
For the speedsolving wiki parity algorithms, you can just do the same algorithms and on a 5x5 and they will work the same
Well many of them will, but many algorithms need to be properly translated to odd cubes before it can be successfully applied to the 5x5x5, for example. But surely all of the oldest and most common <U2, F2, D2, B2, l, r> solutions can be directly translated. (Some algorithms cannot be translated to work on odd cubes at all, or will not have the same/desired effect on odd cubes that it does on even cubes).