A Fully General Ingress Maxfields Algorithm

แชร์
ฝัง
  • เผยแพร่เมื่อ 24 ธ.ค. 2024

ความคิดเห็น • 32

  • @TontoGenio
    @TontoGenio 8 ปีที่แล้ว +2

    7 dislikes from 2nd grade humanities? :)Brilliant, really brilliant set of videos and java program as well. Great sense of humor and clear prononsation. Thank you!

  • @whatisthis2809
    @whatisthis2809 4 ปีที่แล้ว +4

    3:05 poor guy had to use a soft bank to make a few extra fields

  • @chinoto1
    @chinoto1 3 ปีที่แล้ว +1

    Still technically a growing polygon, but I like to imagine a rubber band wrapping all my linked/visited portals, then tugging that rubber band until it hits another portal in the plan.

    • @57Cell
      @57Cell  3 ปีที่แล้ว

      That's a good way to do it :)

  • @BeauKpad
    @BeauKpad 8 ปีที่แล้ว +3

    Nice Fermat reference.

  • @apolkk
    @apolkk 8 ปีที่แล้ว +4

    Can you tell me the name of the program do you use?

  • @phillybroke9882
    @phillybroke9882 4 ปีที่แล้ว +1

    I am from Germany so excuse my bad english! I like your Video but please tell me what can i do if a portal have more then 30 links and i do not want to use a soft bank ultra ? Should the "wave of influence" start from there ??

    • @57Cell
      @57Cell  4 ปีที่แล้ว

      Yes, that will help. Or at least sweep over it early

  • @Sonicgott
    @Sonicgott 6 ปีที่แล้ว +2

    Always plan your event via Ingress Intel, first. Make sure bathrooms are nearby. Drink water. Eat. SLEEP.

  • @undergroundmonorail
    @undergroundmonorail 8 ปีที่แล้ว +7

    yeah, yeah, i get it fermat :P

  • @FinetalPies
    @FinetalPies 8 ปีที่แล้ว

    I just have one concern and this comes up in all your videos. You say to make the biggest field first. But I thought (I have read and was confirmed by anecdotal personal experience) that if a portal was already in a field you could no longer throw links to it. Am I wrong?

    • @57Cell
      @57Cell  8 ปีที่แล้ว +3

      you can link to a portal inside a field, but you can't link from it. try it out!

  • @bukton10
    @bukton10 8 ปีที่แล้ว

    Thanks, but this is a complicated version of fanfield. I would divide the rectangular field into largest possible triangle. First portal will always be furthest from boundary linking those triangles.

    • @chinoto1
      @chinoto1 3 ปีที่แล้ว

      With this method, you could end up making a fan field, but it isn't restricted to just that. You could also make a homogenous, spine, cobweb, or something with no real pattern to it at all, besides there being tons of triangles.

  • @HulkSimpson
    @HulkSimpson 8 ปีที่แล้ว +1

    Thanks for the good explanation. Can you also show us how not to “waste” Softbank Ultra Linkamps? Because in your example here you used more than 8 outgoing links at some portals. Is there an algorithm to avoid this? (Maybe by finding a better shape?!)

    • @57Cell
      @57Cell  8 ปีที่แล้ว

      +Christian HulkSimpson You can try to find a better shape; also, links that make only 0 or 1 field can be made in either direction. It's only links that make 2 fields that *must* be made in a particular direction.

    • @Zalaniar
      @Zalaniar 8 ปีที่แล้ว

      +Michael Hartley And not even necessarily then; rather, you only need to go in a particular direction if you're linking into an already existing field.

    • @57Cell
      @57Cell  8 ปีที่แล้ว

      yes!

    • @Feuermagier1337
      @Feuermagier1337 8 ปีที่แล้ว

      +Michael Hartley But I have to say that your Fanfield algorithm is often superior to this one.
      Its easier to create and defend it, and better suited for areas you often visit.
      It allows you to recreat almost everything quite easy.
      The Jet-Method is better suited for an area you create and leave, cause its hard/impossible to recreate it with a few fields down.
      But also its much harder to attack it, cause no single portal carries heavy load.

    • @chinoto1
      @chinoto1 3 ปีที่แล้ว

      Start building from the portals that have the most planned links on them, that way you don't have to worry about the outbound links so much. Cobwebs are great because the most links on any portal you'll ever have is 6 in total.

  • @benjaminwsoldan
    @benjaminwsoldan 3 ปีที่แล้ว +1

    Coffee Dessert :)

  • @Ueyparu
    @Ueyparu 8 ปีที่แล้ว

    Are you sure this method will yield better AP than the Fanfield?

    • @57Cell
      @57Cell  8 ปีที่แล้ว

      It gives the same AP as the fanfield. The fanfield is an example of a maxfield, as is the cobweb and the herringbone. Each of these particular maximum fielding plans can be produced by the method in this video.

    • @TontoGenio
      @TontoGenio 8 ปีที่แล้ว

      7 dislikes frim 2nd grade humaniries? :)
      Brilliant, reallt brilliant set of videos and java program as well.
      Great sense of humor and clear prononsation.
      Thank you!

  • @kristofspenko9419
    @kristofspenko9419 5 ปีที่แล้ว

    Mr. Hartley, do you have a mathematical proof that this algorithm really gives the most optimal solution?

    • @57Cell
      @57Cell  5 ปีที่แล้ว

      Here's a proof that the optimal solution (for # of fields) must have the structure explained in the video, with each new portal splitting the field covering it into three new fields : www.reddit.com/r/Ingress/comments/47utco/a_simple_algorithm_for_maximising_fields/d0hmtwu/
      When I made the video, I did write down a proof that the method gives a link order that works (ignoring outgoing link limits), but I don't think I kept it, sorry.

    • @kristofspenko9419
      @kristofspenko9419 5 ปีที่แล้ว +1

      @@57Cell thank you very much!

  • @niker4404
    @niker4404 8 ปีที่แล้ว

    So how do we maximise MU points in fielding?

    • @57Cell
      @57Cell  8 ปีที่แล้ว +1

      that's what my next video will be about... Subscribe and look out for the email 😉

  • @kevintherumble
    @kevintherumble 7 ปีที่แล้ว

    nice

  • @cradilyz
    @cradilyz 8 ปีที่แล้ว +1

    "o"