August 2018
Beginner
334 pages
10h 19m
English
Given a list of agents, we take into consideration which one is closest, and, if it is close enough, we make it so that the agent tries to escape from the expected route of that first one according to its current velocity, so that they don't collide.
Read now
Unlock full access