Interesting solutions: Ochominoes 
Ochominoes has 24 tiles, with the colors assigned to tiles by how many little squares each dioct piece has attached to it. The colors divide into 0, 1, 2, 3, 4, 5 and 6 squares, giving three groups of 2 colors and 3 groups of 6. Separating and grouping of colors is a favorite theme. Here are a few color groupings. Finding such solutions is hard! Can you find one where the 8 holes are symmetrically arranged?
Here are a couple of very cool colorgrouped solutions found by Adam Criswell, our staunch squire helping out at Ye Olde Gamery at the Maryland Renaissance Festival. The second one is especially handsome, containing both sticks and enclosing one color completely:
Another knotty problem asks you to form a maximum number of symmetrical pairs. Two tiles when joined can form a symmetrical unit. Now we can try to make a series of connected symmetrical pairs. Our best result to date is 23 tiles forming 22 symmetrical pairs, with just one tile left unintegrated. Symmetries can be in any direction: horizontal, vertical, diagonal, and rotational. All four occur in the figure below. Can you spot them all? Can you form a 24piece snake with all adjacent tiles forming a symmetrical shape? Solve it or prove it impossible, and win a prize. Email us your answer. PROBLEM SOLVED! As of December 26, 2017, a nonexistence proof has come from George Sicherman and his trusty program. So a 23tile snake is the maximum possible, and it has millions of solutions, leaving some 24th piece languishing unpaired. Thanks, George, for clearing up this question. Some answers are just so... disappointing. Still, we're now going to hunt down all the pieces that could be the loner.

Back to Ochominoes 