It is known that the maximum number of layered patterns is achieved in layered permutations. This general result allows the presentation of such optimal permutations with regard to all patterns of length three and most patterns of length four. When the pattern and permutations are colored, the problem, although still of the same nature, becomes different. We present background information and some preliminary studies on this topic.