Write a program for Karel to move all coins from the left room to the exact same positions in the room on the right! There are many possible solutions. One code needs to work for all $4$ mazes shown below.

Sweeping the room efficiently is key. Let's use, for example, a spiral path. The spiral can be defined via a helper list:

H $=[6,5,5,4,4,3,3,2,2,1,1]$

What this means, is "make $6$ steps forward, turn right, make $5$ steps forward, turn right, $...".$ To follow the spiral path, parse this list using a for loop using an index variable n$.$ The body of the for loop is very simple: After making n steps, turn right.

Then create an empty list L to remember the positions of the coins along the way. After each step, append True to L if a coin is there, and False otherwise. You don't need a condition to do this, just take the value of the Boolean sensor coin. Do not forget to collect the coins.

Then move to the other room, and use a similar method to place the coins there, following the spiral path defined by the list H$.$

Sample type of code:

while not home

if coin

get

right

go

if not coin

left

left

go