Ask the Algorithm: Depth-First Dating
An advice-column letter answered by an algorithm: depth-first dating.
Content note: Dating/hookups.
Use this cartoon
Free for classrooms, worksheets, slides and other non-commercial use under CC BY-NC 4.0, with credit to Ben Orlin.
Cartoon by Ben Orlin, Math with Bad Drawings. https://cartoons.mathwithbaddrawings.com/2025-07-29-ask-the-algorithm--ask-the-algorithm-depth-first-dating/ (CC BY-NC 4.0)Transcript
"Dear Algo, I really like the guy I'm dating, but we're only 20. Is it okay if my first real relationship becomes my forever relationship? –Inexperienced in Illinois" / "Dear Ms. Inexperienced: No, it's not okay. Depth-first search is notoriously inefficient. Instead, begin by dating all possible mates {Mᵢ} simultaneously. Prune the least promising until only the highest-quality option M* remains. P.S. Depending on the level of noise in your evaluation function, it may help to randomly reintroduce previously pruned options. Humans often refer to this as 'hooking up with your exes.'"