Two faces contain 18 squares in all, and there are six colors. So it seems that there might be three squares of each color on two adjacent faces. Is it possible for this to be true for all pairs of adjacent faces simultaneously? If so, the most scrambled Rubik's cube would have S = 3.
What if we defined S as the largest number of squares of a single color on three adjacent faces?