How to use algorithms to find the perfect time to party

Puzzle 2: The Best Time to Party · 26:50 · Video: MIT OpenCourseWare · Watch at the source

In short: Ever wondered how to time your arrival at a party to ensure you meet the most interesting guests? This video explores how Professor Srini Devadas uses algorithmic thinking to solve this social dilemma.

In this MIT OpenCourseWare lecture from the 2018 IAP course 'Programming for the Puzzled', Professor Srini Devadas demonstrates how to approach social optimization through a computational lens. The video explains how to design an efficient program that calculates the optimal moment to arrive at an event to maximize social engagement with the 'cool people'.

Opens the Intellect+ feed with this card first. Swipe up for the next one.

Sources

To cite this card, link to https://intellectplus.co.uk/app/ideas-puzzle-2-the-best-time-to-party.

How we source, check and correct cards: Editorial standards.

General information, not professional advice. Spotted an error? Flag the card or see corrections and complaints.

Intellect Plus is a visual educational discovery platform for exploring fascinating facts and ideas. Brain Food, Not Brain Rot. What is Intellect Plus?

Related

Finding something worth knowing…