I highly enjoyed the hexagonal regular expression puzzle from this year's MIT puzzle hunt. I found it awkward to solve on a computer though, it needed a better interface.

So I made one.

Use the ⇐ and ⇒ buttons to rotate the puzzle widdershins or clockwise, respectively (or just hover over the puzzle and use your normal left and right keys).

Click a hexagon and type a letter A-Z (capitalization not important) to fill it with a guess. Hit backspace to clear a guess, and tab to move to the next hexagon in the row.

When an entire row is filled, it will be colored green if the row matches the clue, and red if it doesn't. I'd like to provide some earlier feedback, but to do so correctly would require a good algorithm to determine if the intersection of a regular expression and a string of guesses and blanks have a non-empty intersection. I'm on the lookout for one, so let me know if you find one.