Solve 5 last corners in 4x4x4

[averied]

OK, so I'm trying to solve this 4x4x4 cube with least possible memorized algorithms. So first I follow the basic conversión to a 3x3x3 configuration, and then I used some Pitrus method, so I build a 2x2 block que then expanded to a 2x2x3. From here, I dont know if this will be a dead end, but I want to get to a commutator and conjugates situation (Ryan Heiss).

So What I do, is create a second 2x2x3 connected to the first one, and now my bottom layer is completely solved except one full corner column. I use the edge in this column as a socket to solve the top layer's edges. This ends up with the top layer's 4 corners unsolved and the unsolved column's bottom corner unsolved as well. So just 5 corners left to complete the puzzle.

Is this situation documented for a 4x4x4? Can I run into parity issues that will not happen in 3x3x3 cube? Are there known algorithms for this situation? Will I be able to use commutators and conjugates un this situation? I would love some examples.

Maybe little variation in the method I'm using will make things easier?

Thanks for the ideas!

 

[xyzzy]

Can I run into parity issues that will not happen in 3x3x3 cube? Are there known algorithms for this situation? Will I be able to use commutators and conjugates un this situation?

Yes, yes, and yes.

You'll still encounter "OLL parity" where you have an odd number of flipped edge pairs. You'll still encounter "PLL parity" where the permutation parity of the edge pairs and the corners is odd. PLL parity can be done with a commutator (this is a bit tricky if you want to use only one commutator, much less tricky if you use two) and OLL parity cannot be done with a commutator, but can be done with a conjugated slice move (very tricky).

The names "OLL parity" and "PLL parity" come from CFOP's "OLL" and "PLL" steps, but they're not unique to CFOP and affect every reduction-based method.

Given that you're solving the edges first, PLL parity will show up as a corner 2-cycle or corner 4-cycle. You'd most likely want to use an edge swap alg to fix the parity first, then re-solve the edges. There are algs to swap two corners (or cycle four corners), but they're much longer.

 

[SenorJuan]

Here's a basic guide to sorting out the 'PLL parity' cases when solving corners-last. The algorithms are essentially two algs in sequence, one to solve parity, one to sort out the disruption caused as a result (one is a 'T-perm')
http://www.speedcubing.com/chris/4speedsolve3.html