Freelancer Path Generator *Alpha*
-
Thanks for the bini, but it’s going to be shelved No point working on decrypting stuff when it’s not working ordinarily, so that can be left on the shelf whilst other issues sorted.
Sadly this isn’t the only thing going wrong, had bugs appear in 3rd party software I use as part of my work - so until I solve that, this may be on the burner for a while
-
I am surprised that my first run worked and seemed very good, so I don’t think you are very far away Chips.
The second run with unencrypted ST03b may have incurred errors after the first path that included St03b perhaps?
I’ll zip up my files and post them somewhere and give you the link here, but need some time as my upload is very slow.
thanks pal.
-
I didn’t want to drive you down either, was just trying to help spot a possible cause for no-best-path…
No driving down mate, tis all good.
Managed to find the bug that was causing me loads of trouble at uni, so that’s nearly solved there… but am away all day tomorrow, so hopefully Sunday I shall get around to sorting out any issues with this program insteadALL is welcome, whether it’s criticism, feedback or attempts to help troubleshoot/solve what may be the issue
I would post up the source code if parts of it weren’t so… hacked together in a brutally ugly fashion -
Sorry, not even had a chance to glance at this yet, and not sure when i will. If I haven’t by this weekend, then I’ll probably release the source code incase someone else can program with Java, is familiar with OOP and wants to take it over
its not pretty though
-
Chips,
I sincerely hope you will continue with this, bud, I’m waiting on your success.
It’s nearly there, as I said the first run, with St03b still accidentally encrypted, gave me good paths from a totally remote system that I had not visited back to the systems I had visited, and it was generating good paths from anywhere to anywhere. And I’m running it on my mod, with many new systems.
The second run after I decrypted St03b gave me always “No Best Path” even to the next system, and even between adjacent systems that I had already visited.
I spent a couple of days writing a sort macro (in Excel, its the only way I am capable) and sorted the path files from both runs to look for differences - but there are hundreds!! So I can’t see the wood for the trees!
Even from the first system, Br07, to Br01, the first (good paths) run took the following path (valid):
Path = br07, br01, br07, bw05, rh04, rh01, rh03, bw03, bw01, br03, br01The second run took the following route (also valid):
Path = br07, br01, br07, bw05, ku04, ku01, ku03, bw09, bw10, br04, br01and other paths to other systems showed the same bias, good paths went via Rh04 and faulty paths via Ku04.
What mechanism decides which of two equally valid paths will be followed? Both paths have the same number of system jumps in each case.
I really hope you will continue, but I do understand RL gets in the way, I’m a prime case! lol
Whereas I could and am very willing to spend time to pick up some of the pieces, I doubt if I will understand enough to design the method to continue it to a conclusion any time soon.
-
-
Chips,
I sincerely hope you will continue with this, bud, I’m waiting on your success.
It’s nearly there, as I said the first run, with St03b still accidentally encrypted, gave me good paths from a totally remote system that I had not visited back to the systems I had visited, and it was generating good paths from anywhere to anywhere. And I’m running it on my mod, with many new systems.
The second run after I decrypted St03b gave me always “No Best Path” even to the next system, and even between adjacent systems that I had already visited.
I spent a couple of days writing a sort macro (in Excel, its the only way I am capable) and sorted the path files from both runs to look for differences - but there are hundreds!! So I can’t see the wood for the trees!
Even from the first system, Br07, to Br01, the first (good paths) run took the following path (valid):
Path = br07, br01, br07, bw05, rh04, rh01, rh03, bw03, bw01, br03, br01The second run took the following route (also valid):
Path = br07, br01, br07, bw05, ku04, ku01, ku03, bw09, bw10, br04, br01and other paths to other systems showed the same bias, good paths went via Rh04 and faulty paths via Ku04.
What mechanism decides which of two equally valid paths will be followed? Both paths have the same number of system jumps in each case.
I really hope you will continue, but I do understand RL gets in the way, I’m a prime case! lol
Whereas I could and am very willing to spend time to pick up some of the pieces, I doubt if I will understand enough to design the method to continue it to a conclusion any time soon.
Sounds like I must have used a set somewhere, as therefore it can’t garuntee the order from which it’s elements are returned (simplest explanation for it to be honest).
If I manage to sneak any opportunity at all, i’ll take a look. -
Just a note here that Chips has released a Beta version of this path generator with fixes for some of my problems.
So please follow that thread from now.