How would I prove that a 2-gen algorithm cannot cycle 3 corners?
I recall seeing a page on this subject...it was mostly a proof that if a cube was scramble using <R,U>, and two corners were placed with only <R,U>, that the other 4 corners would have correct permutation.
I was actually thinking about something similar and wanted to find that page; if I find it I will post back here.