See if you can fill in all the blank letter tiles in this graph
using the clues sets below.
Each set of clues yields a name or word. The name or word is guaranteed to follow some connected path through the letter tiles. The arrows indicate the permissible directions that the path may travel.
Unless otherwise stated in the clues, every word or name starts at the tile in the 12 o'clock position (marked with an asterisk).
Paths are permitted to revisit the same tile multiple times.
It is also permitted to have more than one tile in the graph bearing the same letter.
Clue set #1:
Clue set #2:
Clue set #3:
Clue set #4:
He is generally associated with a sacred or mystical "cube", which is often depicted as the five Platonic solids nested within each other.
Clue set #5:
Clue set #6:
Clue set #7: (This one starts at the tile in the 4 o'clock position.)
Clue set #8:
Clue set #9:
Clue set #10:
Clue set #11:
Clue set #12:
Clue set #13:
Clue set #14: (This one starts at the tile in the 4 o'clock position.)
While her name cannot be found along any connected path, you can find it by dancing (;-) all over the graph.
Side notes for topology nerds:
Notice that none of the arrows in the graph cross each other. This makes the drawing a good planar embedding of the graph. As a result, the graph as drawn breaks the plane into discrete, distinct regions, each of which could be uniformly colored with its own color, as you would a coloring book. Like a stained-glass window.
Now, you could just throw the 26 letters of the alphabet onto a page and trace out the entirety of "Hamlet" in one long, continuous path without ever lifting your pen. But you would get thousands of self-crossings in the process and it would be a nasty, tangled mess.
The challenge is to draw the smallest graph possible without any self-crossings. This may sometimes require the same letter to appear on multiple tiles in multiple places. Seeing repeat tiles can feel inefficient or suboptimal, but it is necessary to make the planar embedding work.
If you solve this puzzle and stare at the graph for a while, you might notice that there are places where it could be condensed even further and still maintain a planar embedding. As an example, with a word like REMEMBER, you really only need one "E" tile which be revisited multiple times as it bounces between the "E" and the "R", the "M", the "B", etc. However, all those little back-and-forth loops can get confusing. There is a point at which a drawing is so densely packed with convoluted pathways that it is cruel to the puzzle solvers. So I didn't condense everything as far as I could have. I tried to maintain a general clockwise flow for aesthetics and readability and enjoyment.
But if you think you can condense it to the max, go for it!
1. Wikipedia; Hasbro
5. Wikipedia; Heritage Auctions
6. Wikipedia; Wiki Commons
7. Wikipedia; Wikipedia
8. Wikipedia; Wikipedia
9. Wikipedia; L'Oreal Paris
10. Wikipedia; Wikipedia
11. Wikipedia; Wikipedia; original creation
13. original creation
14. IMDb; IMDb
15. Wikipedia; IMDb