Feature: Prioritize certain nearby pokemon?

[ambasta]

Hi,

Would it be possible to use Pokemongo-Map and prioritize certain pokemons over visiting forts etc?

For example, I'd like to prioritize capturing Eevee or Pidgeys over random enounters b/w walks to forts.

Additionally, a priority map across multiple pokemons can be considered i.e. Eevee more important than pidgey.

Finally, the ability to proritize new pokemons over ones we've already captured.

[joychugh]

I'll try to add that. Sounds useful.

[wesselvdv]

Might be useful to incorporate this into config.json aswell. Maybe 2 options? One for exclusion from the perspective of only wanting to exclude some pokémon, and another for inclusion for the opposite?

[joychugh]

Won't use pokemonog-map but will do it as we encounter pokemon. I will need to make the navigation system as "roam around", (there is an issue reported) once the roam around is implemented, we can set weights to pokemon.

[Jay1]

should we evaluate pokemon with some arbitrary point given by users? like eevee worth 200 and pidgey 150? So the system always catch something

[ambasta]

The way I see it, the ordering of pokemons to catch should be proportional to their priority and inversely proportional to the distance.

To start with something as simple as,

cost(pokemon) = priority(pokemon)/distance(pokemon) should work out.

[Zyrixion]

if it's done as ambasta suggests, I would further suggest that the true rare spawns (snorlax, lapras, etc) have weight enough to make any distance worth it (as they should).

[throwaway999999]

This becomes a bigger problem in areas where there are no pokestops but there are a lot of pokemon around. For example, I used some coordinates on a major intersection where there is a huge cluster of pokemon but no pokestops around. Instead of the bot travelling and capturing those pokemon, the output reads No more spinnable forts within proximity. Walking back. continuously until the program crashes due to recursion.