Code for maximizing the Ingress fields on a given set fo portals
Switch branches/tags
Nothing to show
Clone or download
jpeterbaker Merge pull request #37 from Gamer1120/patch-2
Resolved merge conflicts in
Latest commit 19e94ef Jun 23, 2016


This code is designed to make a plan for linking a given set of portals in the way (and the order) that creates the most fields. This is harder than it sounds. If you're working on more than a dozen portals, learning to use this code may be faster than planning by hand.

This code follows the procedure in my YouTube video.


You'll need Python (I've got 2.7) as well as networkx, numpy, and matplotlib.

You can get these setup easily with the Enthought Python Distribution.

You can use pip to install the dependencies via:

pip install -r requirements.txt


I'll be distributing this code with a file EXAMPLE.csv. Try running

python -n 4 EXAMPLE.csv output/ output.pkl

This will put a bunch of files into the "output/" directory (see OUTPUT FILE LIST)

Now try running

python -n 3 output/output.pkl

This uses the plan stored in output.pkl instead of calculating a new one. It will create files for 3 agents instead of 4.


	List of portals, their numbers on the map, and how many keys are needed

	List of keys agent number M will need (if N agents are participating)

	List of ALL the links
	Total distance traveled and AP earned by agent number M
		* Except for the links marked with a star (*), the links should be made IN THE ORDER LISTED
		* Links with a star can be made out of order, but only EARLY i.e. BEFORE their position in the list (this can save you time)
		* The links that agent number M makes are marked with underscores__
		* The first portal listed is the origin portal (where the agent must be)
		* The second portal listed is the destination portal (for which the agent must have a key)

	A map showing the locations of the portals
	A map showing the locations of portals and links
		* Up is north
		* Portal numbers increase from north to south
		* Portal numbers match "keyPrep.txt" and "linkes_for_agent_M_of_N.txt"
		* Link numbers match those in the link schedules "links_for_agent_M_of_N.txt"

	List of portals whose first link is incoming
		* These portals need to be captured and fully powered before the linking operation
	List of portals whose first link is outgoing
		* You may be able to save time by capturing and fully powering these portals DURING the linking operation

	A Python pickle file containing all portal and plan information
		* The default name is "lastPlan.pkl"
		* In the examples above, this is called "output.pkl"


python [-b] [-n agent_count] input_file [output_directory] [output_file]

-b:          Include this option if you like your maps blue instead of green for any reason

agent_count: Number of agents for which to make a plan

input_file:  One of two types of files:
        a semicolon-delimited file
        the actual file extension does not matter as long as it is not ".pkl"

        two acceptable formats:
            portal name ; lat ; lng [;keys]
            portal name ; Intel URL [;keys]

            To get the Intel URL:
                * Click on the portal at
                * Click on "Link" near the top right of the screen
                * Copy and paste the URL from the box that appears
            Example of an Intel URL:

        portal name should not contain a semicolon
        lat and lng should be the portal's global coordinates
            e.g. the Big Ben portal is at 51.500775,-0.124466
        keys (optional parameter) is the number of keys you have for the portal
        If you leave this blank, the program assumes you have no keys

    .pkl   an output from a previous run of this program
        this can be used to make the same plan with a different number of agents

output_directory: directory in which to put all output
    default is the working directory

output_file: name for a .pkl file containing information on the plan
    if you later use this for the input file, the same plan will be
    produced with the number of agents you specify (default: "lastPlan.pkl")

Warranty and Copyright

Copyright (C) 2015 by Jonathan Baker:

Maxfield is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version.

Maxfield is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.

You should have received a copy of the GNU General Public License along with Maxfield in a file called COPYING.txt. If not, see


The space of possible field-maximizing plans is large. Rather than trying every possibility, Maxfield randomly tries some plans and presents you with one.