CFOP: What is God's Number for PLL and OLL Algorithms?
I have been "speedcubing" on and off for 5-6 years now using CFOP and throughout my experience have come across many different algorithms for the same PLL or OLL cases. Obviously, the number of turns in an algorithm does not imply a faster solution due to possible awkward positioning - much like how it would not be probable that a human would solve a Rubik's cube with its optimal at most 20 turn solution (God's Number). However, just looking at the number of turns, what would be the optimal number of turns for each PLL or OLL case? Have there been tests using God's Algorithm, and if so is there a list of them somewhere?