Splash Biography

Let’s say you have 100 people, each with a number between 1 and 100 inclusive written on their foreheads with some numbers (potentially) repeated. Any given person can see every number except for their own. Each player guesses their own number simultaneously with no communication between players beforehand. Can we ensure that at least one player guesses their number correctly? If you want to play with cool puzzles like this one and learn some of the useful and interesting math behind them, come to this class!

We will talk about graphs, the shortest path problem, and Dijkstra's algorithm for efficiently computing shortest paths. Time permitting, we will talk about other shortest path algorithms and related topics.