Lifehack: Readthrough role assignment.

[carlyrobison]

• Ingest Shakespeare script (e.g. http://shakespeare.mit.edu/coriolanus/full.html)
• Identify who talks to whom
• Assign those roles to N people such that people aren't talking to themselves
• If N is too few, minimize # overlapping lines
• All things being equal, choose the role assignments that most evenly distribute the lines (minimize most # lines - least # lines)

Algorithmically, this is a graph coloring problem; may be able to use an existing solver.