Domande di colloquio per Algorithm Analyst/Statistician presso Apple

In addition to lots of stats questions, A/B testing, sql and R coding questions, I was given one of those stupid brain teaser questions. Setup was a "chicken" can move 1 foot at a time. Chickens are in a 10 foot radius circle with no fence. Farmer will hit chicken and cause it to move back 2 feet in the opposite direction if chicken gets closer to the perimeter of the circle. However, farmer will not hit chicken if the chicken will end up equally or closer to the perimeter after the 2 ft retreating move. Describe an algorithm to get the chicken out of the circle without getting hit. How many moves will it take? Is there a shape you can imagine that the chicken could not escape from?