I am only using the code as a great mathematical challenge and solving it using python. This code is run independent of anything that Kixeye uses for the game, interaction with another player, created apps or gameplay. I am in no way using this code to tamper with another player, the game, app or gameplay. I would be more than happy to learn of a different way to code this or a better way mathematically to do it. Then finally I added a condition so it would take the maximum combined total of the 7 fleets and then only output future combinations that are larger than the previous one output. So I introduced an if statement so if the fleet mass amounted to over 10,000 it would not execute the for loops after that threshold was hit.Īfter the above challenges I found that sometimes a fleet would try and include a duplicate ship that did not exist because the for loop would complete without reaching maximum mass of 10,000 or above and pass the last value of the for loop into the fleet.Īlso one or more of the 7 fleets would not be generated in the for loops so not to output these fleets but only the ones that are complete.
MOBIL VEGA CONFLICT HACK HOW TO
I could not figure out how to break out of the 6 for loops without breaking out of the 7th which is used to generate all 7 fleets. Then if the the fleets mass amounted to over 10,000 then break out of the for loops.
![mobil vega conflict hack mobil vega conflict hack](https://mir-s3-cdn-cf.behance.net/projects/404/aa8bc558815381.Y3JvcCwxMzU5LDEwNjQsNjcsMA.jpg)
However each for loop had to be looking at a unique ship in the list so an if statement was created to work around this issue of the variables counting the loop could not be accessing the same item in the list of ships. In creating 1 fleet, I would send the calculations through 6 for loops, one loop for each ship in the fleet. I found that instead of sorting the list by smallest to largest or largest to smallest I received the best results if I randomized the list using random.shuffle. So I have a total of 51 ships accounted for in the above lists.
![mobil vega conflict hack mobil vega conflict hack](http://vegaconflict.com/s1.jpg)
![mobil vega conflict hack mobil vega conflict hack](https://i.pinimg.com/originals/47/58/2b/47582bb6a030e4332e350e58e0ae870d.png)
The challenges and what I learned from this problem: Now back to the math of trying to figure this out, here are the ships placed into python lists based on their mass:ĮxodusCruiser =