No Adjacent Colors on Cube

First note that any two colors on a single cublet is always different colors (this is pretty obvious). Thus we just need to consider two adjacent faces of two adjacent cublets.

There are $12$ adjacent cublet faces on a single Rubik's cube face(just count them). Thus, there are $72$ adjacent cublet faces in total. Each turn can destroy at most $12$ adjacencies (3 adjacencies per the 4 faces affected) so the lower bound is $72\div 12=6$ .

This minimum is achievable by doing the common checkerboard pattern, thus the answer is $\boxed{6}$ .

cube

Use the following moves to achieve this: $R^2 L^2 F^2 B^2 U^2 D^2$

My best solving time is 64 seconds. Please comment yours