[00:01] bacteria sitting on a grid. At any [music] point, you can select one of them, and if the spaces one above and one to the right are both empty, you can make it replicate, [music] populating both of those spots with its children
[00:14] from. The rule is that only one cell is those two target spots is currently blocked for a given bacterium, it can't replicate. But as soon as both of them clear out, it's free to do so.
[00:27] >> Here's my puzzle for you. Suppose you begin with just one cell at the origin, and your goal is to eventually clear out this box here, the one with corners at 0 this box here, the one with corners at 0 0, 0 3, 3 3, and 3 0. What is the
[00:41] smallest number of moves required [music] to do so? To be clear, all 16 of these lattice points have to end up empty. This is part of a monthly series collaboration with MoMath. The mathematician Peter Winkler will host a
[00:55] [music] and I'll post my own video of the solution here sometime next month.