Skip to main content
5 events
when toggle format what by license comment
Oct 24, 2014 at 16:43 comment added ahulpke At least for 6x6 and 8x8 (I suspect for all but did not test) the group is the full symmetric group, so any permutation would be possible.
Oct 24, 2014 at 15:00 comment added Ilya Bogdanov Can you reach every combination of colors? Or there are some invariants --- in this case, which?
Oct 23, 2014 at 9:04 comment added Alewyn Burger I built a tree, storing all states that are exactly 1,2,...,10 moves away from the unmixed state. There are 743961173 on level 10 and it can be stored in about 6GB. I only store non-isomorphic states under the 4! colour changes and 8 orientations of the grid. I then compute all the states that are exactly 1,2,...,10 moves away from the MIXED state above and check if each of these states is in level 10 of the first tree. Since no matches were found, there is no way to solve that configuration in 10+10 moves. This computation took about a week to do, but I am sure there are faster ways to do it.
Oct 22, 2014 at 15:27 comment added The Masked Avenger How exactly is the lower bound established? It seems too big for exhaustive search.
Oct 22, 2014 at 14:35 history asked Alewyn Burger CC BY-SA 3.0