How can there be no possible moves? With 3 colors and 4 non-empty stacks, there are always 2 stacks with the same color on top, so we can move all nuts of this color from the top of one stack to another. This either decreases the number of pairs of adjacent nuts with different colors, or adds an empty stack which we can use to do the same thing.