i am trying to learn blind solve of 3X3. trying to do it by old pochmann method. i saw in pochmann website that we can solve the cube by using a single algo that is T permutation( i know there are J and Y perm we can use to make it faster, but i am not worried abt time right now). i would like to know abt parity cases. there is no mention of parity cases or parity algo in this method. what are the case i will have parity and what algo do i need to use to solve them?
here is the method i am talking about
http://www.stefan-pochmann.info/spocc/b ... _index.php