There is an infinite grid of squares.

In one of many squares, there lives an amoeba (marked as a circle within the following footage).

Amoebas can’t transfer, however they will carry out their distinctive motion: an amoeba can break up itself into two amoebas, that are similar to the unique one, and every will occupy a sq. that’s (orthogonally) adjoining to the unique sq..

Since each sq. can solely accommodate one amoeba, a splitting can solely occur when the amoeba has at the least two empty adjoining squares (if there are greater than two, then it could select freely to which squares to separate). Also, two amoebas mustn’t break up concurrently, in order that no battle ought to happen.

On the grid, there’s a area referred to as “the jail” (painted gray within the following footage). The intention is to let the amoebas escape the jail, i.e. to succeed in a standing that no amoeba is within the jail.

Question 1: Help the amoeba escape the next “cross” jail.

Question 2: Help the amoeba escape the next “twisted cross” jail.

Question 3: What in regards to the following “octagon” jail, which is the mixture of the earlier two?

Note:

• The options are clearly not distinctive, as one could proceed splitting after escaping from the jail. Thus in precept, you must attempt to use as few splittings as potential.

• Click the images for bigger variations. Although the image solely exhibits an $11 instances 11$ a part of the grid, the precise grid is infinitely massive and the answer could prolong to exterior.