Using Nash Equlibrium to build minimalist PvE lists for Pokémon GO.
This repo uses the Nash Equilibrium to build a minimalist PvE list for Pokémon GO: With few Pokémon, you are able to seize all gyms and defend against all gym invaders. This practice allows you to concentrate your resources on few Pokémon and build an all-round strong team.
This repo is Python 3 and depends on the following package:
- pandas <=v0.23 (v0.24 won't work)
$ python pokemongo.py
The results is stored in the
metalist.txt file by default.
A Jupyter notebook with the same name is provided as the demo.
- master: timeout as win condition in gym battles
- raid: boss raid
The dataset is contributed by Reddit user UW_Unknown_Warrior.
Also thanks to Vince Knight for helpful discussion.