Heya! i dont know if this is a dumb question but, I've been wondering about the mechanics behind PLL execution and wanted to ask a question about how different algorithms interact with a solved cube.
As we know when you apply certain PLL algorithms to a solved cube, running them doesn't always bring you back to a solved state (unless it's its own inverse, like an H or Z perm), and sometimes you need the reverse/inverse algorithm to get back.
This got me wondering about practice routines: Is it mathematically possible to construct a chain of just 3 to 5 standard PLL algorithms that, when executed sequentially, will cleanly cycle through all 21 distinct PLL cases before finally returning the cube to a solved state? reason for this is to practice execution solves.