[Question]
  [
Today's Google doodle is about [Celebrating 50 years of Kids Coding](https://www.google.com/doodles/celebrating-50-years-of-kids-coding):
The goal is program the path of a little bunny so that it can eat all the carrots. There are 4 types of blocks (see pictures below):
[![block description](https://i.stack.imgur.com/aIjhc.png)](https://i.stack.imgur.com/aIjhc.png)
From left to right: 
* `O("...", k)` = orange piece: these are `for` loops which executes k times the program `"..."`.
* `G` = green piece: go one step forward if you can, otherwise do nothing
* `Bl` = blue piece: turn right and stay on the same block
* `Br` = blue piece: turn left and stay on the same block
[![big program](https://i.stack.imgur.com/WeKGs.png)](https://i.stack.imgur.com/WeKGs.png)
The code above can be written as 
```
O(O(G G Br, 4) Bl Bl, 23)
```
Each block (`G, Bl, Br, O(...,k)`) counts as 1 unit, so this program is of length 7. Note than the value of `k` is included inside the 1 unit of `O`.
There are 6 levels. To finish a level you need to eat all the carrots. It is not a problem if your program is not fully executed, the level finishes directly when you eat the last carrot.
We assume that all the 4 types of blocks are available in every level.
> 
> **Your task is to find a single program which solves every level of the game.  
> 
>  Shortest program in blocks wins.**
> 
> 
> 
Screen shots of each level:  
Level 1: [![level 1 screenshot](https://i.stack.imgur.com/BCmoY.png)](https://i.stack.imgur.com/BCmoY.png)  
Level 2: [![level 2 screenshot](https://i.stack.imgur.com/8GqzY.png)](https://i.stack.imgur.com/8GqzY.png)  
Level 3: [![level 3 screenshot](https://i.stack.imgur.com/TX5Mt.png)](https://i.stack.imgur.com/TX5Mt.png)  
Level 4: [![level 4 screenshot](https://i.stack.imgur.com/J4NVl.png)](https://i.stack.imgur.com/J4NVl.png)  
Level 5: [![level 5 screenshot](https://i.stack.imgur.com/aSi1d.png)](https://i.stack.imgur.com/aSi1d.png)  
Level 6: [![level 6 screenshot](https://i.stack.imgur.com/ebjGV.png)](https://i.stack.imgur.com/ebjGV.png) 
  
[Answer]
# Not my answer
6 blocks
The user [Alex](https://codegolf.stackexchange.com/users/86858/alex) found a shorter solution, of length 6. I can confirm that their solution works:
```
O(O(Br G G, 6) Br, 5)
```
[![6 blocks](https://i.stack.imgur.com/YpoxP.png)](https://i.stack.imgur.com/YpoxP.png)
They attempted to edit this question to add this answer, so I'm assuming they want it to be displayed here. I don't like how the reputation system works around here.
The message they left:
> 
> The editor doesn't have 10 rep, but does have a solution of length 6. O(O(RGG,6)R,5)
> 
> 
> 
After a few days they responded again via editing the post with: *"Thanks for doing this. Editing this was the only way I saw to get a message. I am happy it exists at all. Feel free to bring it into a new post if you want though."*
# Old answer
7 Blocks
```
O(O(G G Br, 4) G Br, 100)
```
Patience required.
Edit: The image was wrong.
[![7 blocks](https://i.stack.imgur.com/xvXFM.png)](https://i.stack.imgur.com/xvXFM.png)
[Answer]
Actually, I found a solution with 8 blocks
```
O(O(O(G,4)R,4)GGR,4)
```
[Answer]
## Manually found, 9 blocks
`O(O(GRGLGR,4)L,4)`
I started with the obvious `O(O(GGR,4)L,4)` that solves levels 1-5 then tried a few variations adding effectively-null moves on those levels to find one that would complete level 6. The shortest was a simple right-forward-left in the middle of each "bridge" so the forward move had no effect.
]