eef1805fe6
* fix: clean-up Project Euler 201-220 * fix: corrections from review Co-authored-by: Tom <20648924+moT01@users.noreply.github.com> Co-authored-by: Tom <20648924+moT01@users.noreply.github.com>
43 lines
790 B
Markdown
43 lines
790 B
Markdown
---
|
||
id: 5900f4411000cf542c50ff54
|
||
title: 'Problem 213: Flea Circus'
|
||
challengeType: 5
|
||
forumTopicId: 301855
|
||
dashedName: problem-213-flea-circus
|
||
---
|
||
|
||
# --description--
|
||
|
||
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.
|
||
|
||
# --hints--
|
||
|
||
`fleaCircus()` should return `330.721154`.
|
||
|
||
```js
|
||
assert.strictEqual(fleaCircus(), 330.721154);
|
||
```
|
||
|
||
# --seed--
|
||
|
||
## --seed-contents--
|
||
|
||
```js
|
||
function fleaCircus() {
|
||
|
||
return true;
|
||
}
|
||
|
||
fleaCircus();
|
||
```
|
||
|
||
# --solutions--
|
||
|
||
```js
|
||
// solution required
|
||
```
|