Annoying Tiles

Ten square tiles are placed in a row, and each can be painted with one of the four colors red (R), yellow (Y), blue (B), and white (W). Find the number of ways this can be done so that each block of five adjacent tiles contains at least one tile of each color. That is, count the patterns RWBWYRRBWY and WWBYRWYBWR but not RWBYYBWWRY because the five adjacent tiles colored BYYBW does not include the color red.


The answer is 7296.

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

0 solutions

No explanations have been posted yet. Check back later!

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...