Bacteria Grid Puzzle Solution
A puzzle about bacteria replicating on a grid that asks for the minimum moves to clear 16 lattice points is revealed to be impossible. The solution uses a clever weighting system to prove mathematically that bacteria cannot escape certain grid boundaries.
Summary
The video analyzes a bacteria replication puzzle where cells start at the origin and can replicate by populating spots above and to the right when both are empty, leaving the original spot unoccupied. The goal was to find the minimum moves to clear all 16 lattice points in a specific box. Starting with smaller cases, a 1x1 box takes one move and a 2x2 box takes eight moves, but attempting a 3x3 box reveals the astronomical difficulty. The key insight comes from finding an invariant quantity - a weighting system where each diagonal line has half the weight of the previous one, with the origin having weight 1. Since each replication converts one cell into two on the next diagonal, the total weighted sum always remains constant at 1. By calculating the sum of all weights on the infinite grid (which converges to 4) and comparing it to the weights inside the target box (3.5+ for the 16-point box), the analysis shows that the remaining weight outside the box is less than 1, making escape mathematically impossible. This proves the puzzle is unsolvable - bacteria cannot clear the 16-point box, the 9-point box (weights sum to 3.0625), and can barely clear an 8-point configuration only with infinite time.
About this episode
Part of a monthly series of puzzlers, in collaboration with MoMath and Peter Winkler
Key Insights
- The speaker establishes that finding invariant quantities that remain constant regardless of choices made is a crucial problem-solving strategy when dealing with situations that can unfold in huge or infinite ways
- The speaker proves that any replication move preserves total weight because it converts one cell into two cells on the next diagonal line where weights are halved, keeping the weighted sum fixed at one
- The speaker demonstrates that the sum of weights inside the 16 lattice point box exceeds 3.5, while the total grid weight is only 4, leaving insufficient weight outside to allow bacterial escape
Topics
Transcript
[0:00] Last month, I shared a puzzle about bacteria replicating on a grid. We start with just one cell at the origin. And at any point, if the spots, one above and one to the right of that bacterium are empty, then it's allowed to replicate, populating both of those spots, leaving the previous spot it was on unoccupied. The puzzle is to find the minimum number of moves required to clear all 16 lattice points inside this box here. A natural place you might start is with a smaller box. For example, at the smallest case, clearing that one first lattice point obviously just takes one move. If you move up to a 2 by two box [0:32] with…
Full transcript available for MurmurCast members
Sign Up to AccessMore from 3Blue1Brown
Tie random ends: How many loops?
A math puzzle video presents a probability problem involving tying random string ends together to form loops. Starting with 50 strings and tying ends together 50 times, viewers are asked to calculate the expected number of loops. Solutions to monthly puzzles are shared on Patreon rather than in individual videos.
Covering 10 points, a surprisingly tricky puzzle.
A mathematical puzzle is presented asking whether 10 arbitrary points on a 2D plane can always be covered by non-overlapping unit discs (radius 1). The puzzle explores edge cases from covering all points with one disc to requiring individual discs for each point.
Escher's most mind-bending piece
An analysis of MC Escher's 1956 lithograph 'Print Gallery,' which depicts a paradoxical scene where a man views a picture that contains the very gallery he's standing in. Mathematicians in 2003 discovered the mathematical principles underlying this recursive artwork, including what should theoretically fill the mysterious blank space at the center.
The subset sum puzzle
A mathematical puzzle game is presented where one player chooses 10 numbers from 1-100, and the other must find two distinct subsets with equal sums. The challenge is to determine which player has a winning strategy.
How (and why) to take a logarithm of an image
The video explores how M.C. Escher's 1956 lithograph 'Print Gallery' can be mathematically analyzed through complex functions, specifically using logarithms to transform self-similar images into warped loops. The analysis reveals deep connections between Escher's intuitive artistic process and mathematical concepts like conformal mapping and elliptic functions.