It's a crossword puzzle where you need to fill in the hexes with character sequences, so that they match the regular expressions listed around the edges.
The individual clues will turn bold green when satisfied, red when not, and underlined when active.
Note that the regex must be a full match, and empty cells are treated as spaces.
[^X]*(DN|TE|NI)[RONMHC]*I[RONMHC]*.*(..)\1P+(E|RC|NM)*([^MC]|MM|CC)*R?(CR)*MC[MA]*.*
.*H.*H.*.*CDD.*RRP.*
(DI|NS|TH|OM)*(XHH|[^XH])*
F.*[AO].*[AO].*([^CME]|ME)*
(O|RHH|MM)*.*RXO.*
.*.*LR.*RL.*
C*MC(CCC|MM)*.*EU.*ES.*
[^C]*[^R]*III.*
(...?)\1*(S|MM|HHH)*
([^X]|XCC)*[^M]*M[^M]*
(RR|HHH)*.?(XR|[^R])*
N.*X.X.X.*E[ROMEA]*HO[UMIEC]*
R*D*M*.*(.)X\1C\1.*
.(C|HH)*[^C]*MMM[^C]*
.*H.*V.*G.*[RC]*M*XEX.*.*MCC.*DD.*.*X.*RCHX.*.*(.)(.)(.)(.)\4\3\2\1.*(NI|ES|IH).*









Original puzzle written by Dan Gulotta for the 2013 MIT Mystery Hunt.
Select a puzzle:

Javascript implementation by Jimb Esser. Source code available on GitHub, fork and add your own puzzles!
Solution available here.
Your work should be saved if you refresh the page or come back later.
y0: ???????
x0: ???????
z0: ???????
y1: ????????
x1: ????????
z1: ????????
y2: ?????????
x2: ?????????
z2: ?????????
y3: ??????????
x3: ??????????
z3: ??????????
y4: ??????????? (match)
x4: ??????????? (match)
z4: ???????????
y5: ????????????
x5: ????????????
z5: ???????????? (match)
y6: ?????????????
x6: ????????????? (match)
z6: ?????????????
y7: ???????????? (match)
x7: ????????????
z7: ????????????
y8: ??????????? (match)
x8: ??????????? (match)
z8: ???????????
y9: ??????????
x9: ?????????? (match)
z9: ??????????
y10: ?????????
x10: ?????????
z10: ????????? (match)
y11: ????????
x11: ????????
z11: ????????
y12: ???????
x12: ???????
z12: ???????