In the docs there is a line, explaining how targeting works:
- Choose the nearest target(s). Note that the potential targets could include multiple locations if they are the same distance away.
Is this about the euclidian distance or the manhattan distance?
My belief is that this is euclidean distance. I tried using Manhattan distance for my simulator (# of steps) and it gave unreliable results in certain conditions.
I am pretty sure it is the euclidean distance. There is even in the python starter-kit, in advanced_game_state.py a get_target() method that calls game_map.distance_between_locations() which returns the euclidean distance.