@OscarCunningham@mathstodon.xyz First thought is that it's equivalent to finding a colouring of the dodecahedral graph such that every 6-tuple of a node and its neighbours has a unique colouring up to rotation. There are at most 4096 2-colourings of a graph with 12 nodes, so it's very brute-forceable. And I see someone beat me to it.