by Bruno Smaniotto. Consider the following game: You are given the option to choose between two coins to flip. These coins are possibly biased, so the probability of getting Heads for each coin might differ from 50/50. Each time that you flip Heads, you win one dollar. There are a total of 10 rounds. Which coin should you flip at each round? In this blog post, we will analyze this problem through the lens of a famous decision-making algorithm called the Multi-Arm Bandit, exploring how to structure the problem mathematically and how it can be solved for particular examples.