search

jpeterbaker / maxfield

Code for maximizing the Ingress fields on a given set fo portals
GNU General Public License v3.0
165 stars 56 forks source link

Pre-existing links #17

Open ProfM2 opened 10 years ago

ProfM2 commented 10 years ago

I'm in an area where there are a couple/few links that I cannot take down (it's my side). Is there any way to define these pre-existing links and have the program work around this limitation? The other issue is that I'm not sure if these are inbound or outbound links.

Related to this, to be able to define existing links to outside of the fielding area. Again, the unknown is if the links are inbound or outbound, but would affect the perfect fielding.

jpeterbaker commented 10 years ago

I've thought about this problem, but I don't have a good algorithm solution yet. I think it will be very difficult to handle this perfectly, but it's still on my list of things to try. When I have this situation, I call on an opposite team friend who is sometimes willing to knock down my team's misplaced links.

ToeBee commented 10 years ago

This is what viruses are for :)

frozen905 commented 8 years ago

Would love a solution for this as well. There's a small field consisting of 4 portals inside a larger area of 15-20 portals and I can't figure out how to work around it

silicontrip commented 8 years ago

Hi Guys, I've been working on a set of tools similar to maxfields but broken into parts. The first part is a field generator, which can produce different field plans (in drawtools format) depending on the requirements, IE maximum fields in an area or maximum layers for a mega field based on clusters. The tool can be told to ignore or respect existing links. The second part is a key requirements generator, it simply goes through both directions of every link and produces a score of the different metrics, such as outbound links, total keys for a single portal and cluster direction (for field plans that make sense having clusters) having only 3 cluster directions makes it easy for a single agent to put up a plan. Additional filtering such as discarding plans of more than 8 outbound links, saying that a particular portal has an SBUL or filtering based on maximum keys can be done here. The third part then analyses different link orders to determine if the plan is valid, IE if a field will block links yet to be made. It calculates the distance between source portals and attempts to find the shortest distance, similar to a TSP solver. I'm currently using a brute force algorithm so haven't been able to find the best solution, I'm still working on this part, this is also the place to say that there are additional agents. I'd be interested in discussing this more. I'm not really familiar with the mathematics of fielding, so all my tools use brute force.