This website is a semi-functional mirror of the original Project Euler. More information is available on GitHub.
Flea Circus
Problem 213
Published on 18 October 2008 at 10:00 am [Server Time]
A 30×30 grid of squares contains 900 fleas, initially one flea per square.
When a bell is rung, each flea jumps to an adjacent square at random (usually 4 possibilities, except for fleas on the edge of the grid or at the corners).
What is the expected number of unoccupied squares after 50 rings of the bell? Give your answer rounded to six decimal places.
Go to back to Problems