Kara looks for the next leaf in the following order (see picture below):

• On the square in front of him.
• On the square to the left of his original position.
• On the square to the right of his original position.

The following part of the program implements this search:

kara.move()                
  if not kara.onLeaf():
    turnAround()            
    kara.move()
    kara.turnRight()
    kara.move()
    if not kara.onLeaf():
      turnAround()           
      kara.move()
      kara.move()
  kara.removeLeaf()