A subset of RUMIS Solitaire, namely the 3I-Q cube (where the 3I and the 4Q stones are not used) was analyzed under the name of the Soma Cube by H.J. Conway (of Life Game fame) and a colleague; they deduced that 240 solutions are possible.
On web page on the Soma Cube (see the URL above) one can also find a statement that the 3C-T cube (where the 3C and the T stones are not used) has no solution. This comes as part of the solution to the problem of assembling 3x3x3 cubes from all possible 'stones' containing 3 and 4 unit-cube elements, a collection known as Rehm's Cube Set.
Also listed are the number of solutions for all the other 3x3x3 cubes, giving the same two series of 7 cubes each that I used in my first post. There is no reason given why the 3C-T cube cannot be assembled.
However, a discussion of the possible solutions to the Soma Cube (3I-Q) is found on another web page, see Soma Cube Secrets .
Here the number of vertices in the assembled cube each stone can occupy is analyzed and used to derive a criterion for the existence of particular solutions, that is, whether a particular stone can be in a specific place within the cube, namely in 'normal', 'central', or 'deficient' position. This notion is introduced as the Hidden Secrets of Soma.
To see whether this secret could be helpful in finding the reason for the impossibility of the 3C-T solution, the maximal vertex counts for the 14 numerically possible 3x3x3 cubes from the Rehm Cube Set were determined, see the table below.
The table gives the sum of the maximal vertex count from all stones in any particular type of cube. There is no difference in the counts between the 3C-T and the 3C-L cubes from which follows that the concept of deficiency in the position of the L stone alone cannot explain the impossibility of assembling the 3C-T cube. In other words, the 'cornerness', namely counting the number of vertices the stones can contribute to the tri-cube, is not sufficient to decide on the possibility of a configuration.
The additional concept needed is the 'parity' as explained in Thiele's Impossibility Proof for the 3C-T tri-cube, see Thorsten Sillke's entries in the link to Math Basteleien. Parity essentially decides whether a stone can occupy a corner position or not, based on the number of 'black' and 'white' cubes in a stone if the tri-cube is colored in a checkered pattern. Then the difference between the L and the T piece becomes obvious in that parity forces the 3I stone, in the 3C-T tri-cube, into a position in which it cannot contribute to a vertex thus making a solution impossible. Conversely, for the 3C-L tricube, parity allows the 3I piece to occupy an edge where it contributes to two vertices thus making solutions possible.

