carlyrobison / lifehacks Goto Github PK

https://www.worldwaterfalldatabase.com/country/United-States/California/list

• 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.

Inspect Caltopo's web requests for creating lines, markers, different colors, titles, notes. Note any special characters that may make things rough. Note folders for putting these items in.

Make a Caltopo "API".