Netlogo - part 2 (PDF)

Universitàdi Modenae ReggioEmiliaSimple Algorithmto move-turtlesask turtles[ set heading (random 360)fd 1]endAgents and PervasiveComputing Group• the turtles cannot see ahead farther than just onepatch;• each turtle can move only one square each turn;• turtles are blissfully ignorant of each other.