Maybe I'm missing something, but this doesn't seem so hard. Every cord must start at some point on the circle and end at some point on the circle. If P is the set of all points on the circle, then the set of all cords is the set of all possibilities of (p1, p2), where p1 and p2 are in P.
The ninja story doesn't work here, since for any p1 I think there's exactly one p2 possible. The photographer story DOES work, since he can start at any point, and the mermaid can then be at any second point. I'm not sure about the dragon story, but I'm guessing it doesn't work either.