All possible permutations on a Rubik cube ($3\times3\times 3$) can be reached from the initial state? If I were to represent a state in the Rubik cube as a permutation of the colors on the 9 tiles per side on all sides of the cube, could I reach all possible states (i.e. colorings) by the permutations allowed by the cube alone?
In other words, is there a legal coloring such that it's unreachable from the initial state (every side of the cube has only its own distinct color) ?
many thanks!
 A: There are different ways of defining "legal". 
In a comment, the OP posits that legal could mean 

by legal I mean that for a 3x3x3 cube there are exactly 9 tiles with the same color, and there are 6 different colors.

In which case the existence of "legal" colorings not reachable by standard Rubik's cube moves is trivial: observe that a Rubik's cube move only sends


*

*Corner pieces to corner pieces

*Center pieces to center pieces

*Edge pieces to edge pieces


So if you peel of the Red center piece sticker and swap it with the sticker of a blue edge piece, you will still have 9 "red tiles", but no "red center tile", so it cannot be arrived at by a standard permutation. 
Okay so perhaps you want to strengthen the condition on the tiles. May be we amend the definition of legal to be

A color configuration is legal if there are 6 total colors, each color has 9 tiles, and of the 9 tiles you have 1 center piece, 4 corner pieces, and 4 edge pieces. 

This is still not sufficient to guarantee that the cube is solvable. One property of the standard Rubik's cube moves is that opposite centers can never be made adjacent. So take a solved standard cube, with (assuming) white being the top face, blue being the bottom face, and red being a side face. If you take an arbitrary edge sticker off the blue side, and swap it with the red edge sticker that is adjacent to the white face you've created an impossible cube, because the cube now has an edge face with white/blue, but white and blue centers can never be adjacent. 
So okay, that is still a trivial impossibility. Perhaps we need to strengthen our definitions even more. The next natural assumption is then

In a solved cube there are 12 edges and 8 corners. Each edge has two colors. Each corner has 3. We say a color configuration is "legal" if it has 6 total colors, 9 tiles of each color, with 1 in the center, 4 on the edge, and 4 on the corner. Furthermore, we require that the color combinations for the edges and corners are in one-to-one correspondence with those available on a solved cube. 

In fact, this turns out to be what I call the "take the cube apart and reassemble" definition. (You'll know what I mean if you've ever tried taking apart a Rubik's cube.) 
In this situation there are still impossible configurations: for example, if you pry off one single edge piece and re-insert it "upside down". The proof that such configurations are impossible is more difficult, and requires learning some group theory. (See chapter 11 of this exposition.) But the fundamental idea behind the argument is same as the previous cases: one needs to find "algebraic invariants" which describe the configuration of the cube, and which values are left unchanged by the Rubik's cube moves. By constructing a configuration with a different value for the invariants compared to the solved cube, you obtain an example that can be demonstrated to not be solvable. 
In the first example, the algebraic invariants are the "number of edge/center/corner tiles per color". In the second example, the algebraic invariants are "the number of edges shared by two given colors". For the third example, I invite you to read the linked PDF file. 
A: If I remember correctly, 1/6 of the permutations are reachable.  The total edge parity (mod 2) and corner twisting (mod 3) have to be the same as the starting position.  
Edit: according to the document linked in the comments under the question there is an additional parity condition, and the fraction of reachable positions is 1/12.  
