Factorization Array

The game creates an array of points surrounding each avatar. Loot points are are located where those coordinates can be best factorized by your skills.. Simple, done, Thats how it works.. Send me a message regarding this array and mining if you want to know more…

Waves use coord/1 .

I am so done with this game for now… I need to cool off, the waves are absolute garbage and insult this system.

3 Likes

Bye/1

1 Like

.

ye there are a lot of them, really wish they were gone though.

So after using the array repeatedly, as expected the hitrate starts dropping off. The strategy for this method would be to switch from server to server when the hitrate starts to drop off.

waves are more noticeable as less and less people play.

1 Like

Sorry can you elaborate?
I don’t care much for mining but hunting how does this help in hunting?

Were you the poster with the theory that mining drop rates are reverse engineered to tether Ore/EnMatter prices to real-world commodity prices, or was that someone else?

That was me ye, back in the day…

Oh the good ole days…

1 Like

I think I will post the method and results that I am getting as well as the python app that I am using, in the Mining forum, so that comparative runs can be made by persons that are interested in this.

You can use the following Prompt to assist in python code generation for a LLM.

DISCLAIMER, not responsible for the resulting code or its use/misuse… This is an interesting experiment.

I need a Python Tkinter application with the following features:

[HEADING=2]UI Components:[/HEADING]
[ol]
[li]An input field for X Coordinate.[/li][li]An input field for Y Coordinate.[/li][li]An input field for Radius.[/li][li]An input field for Factor.[/li][li]A button labeled “Best Match” to calculate and find the best match coordinates.[/li][/ol]
[HEADING=2]Functionality:[/HEADING]
[ol]
[li]The application should automatically save all input values and the best match coordinates to an ini file whenever any input field is changed or when the application exits.[/li][li]It also needs to load the ini file when the application starts in order to preserve its state.[/li][li]When the “Best Match” button is clicked:[/li][ul]
[li]Generate a square array of points centered at the given (X, Y) coordinate within the specified radius.[/li][li]Find the best match for the Factor from the generated points.[/li][li]Update the X and Y Coordinate input fields with the best match values.[/li][li]Copy the best match coordinates to the clipboard in the format: /wp [Calypso, {x}, {y}, 200, Python Matcher].[/li][/ul]
[/ol]
[HEADING=2]Requirements:[/HEADING]
[ol]
[li]Do not display any notification boxes.[/li][li]Save all inputs (X, Y coordinates, Radius, Factor) and the best match coordinates to an ini file whenever any input field is changed or when the application exits.[/li][li]The application should load the saved values from the ini file when it starts.[/li][/ol]

1 Like

I am absolutely blown away right now… The game does not use a 2d plane, its a pseudo 3d cube, finders make a major difference, areas that you think are dead on the surface level, may not be deeper…

Always face north when looting and scratch your left earlobe when you get perception

3 Likes

The more you post the more my statement that all very smart players never make.money playing this game.
i can be wrong tho but im not most of the times

1 Like

math part is missing, I bolded the part that needs you to fill in your actual insights. Also, you said youd post your code in the mining forum? cant find it :frowning:

Most of this is just fluff, just ui and saving stuff and the interesting part is missing? Chatgpt interprets your prompt but the part: "Find the best match for the Factor from the generated points." evaluates to this I think:?

for i in range(x - radius, x + radius + 1):
for j in range(y - radius, y + radius + 1):
# Simulate some evaluation function
value = abs(i - x) + abs(j - y) + factor # Simplified for demonstration
if value < best_value:
best_value = value
best_x, best_y = i, j

so just some dummy calculation?

Looks like i will have to give a better prompt… I had the app all setup in gpt, but the prompt it generated is not 100% correct. I will do it during the course of the day..

The code has to sort the coordinates in ascending distance and find the “best match” ie coord/factor should have a remainder as close to 1 or 0 as possible with the best match of both being the closest average of the 2 closest to 0 or 1. Mine returns a % match. Perhaps below can help.

Function to calculate the match factor for a coordinate pair

def calculate_match_factor(x, y, factor):
if factor == 0:
return 0
x_factor = 1 - abs((x % factor) / factor)
y_factor = 1 - abs((y % factor) / factor)
match_factor = (x_factor + y_factor) / 2 * 100
return match_factor

And that is it, due to some new information, I do not wish to share anything else publicly.

Factor = 1/(hitrate%/100)…

Simple

There is so much more though, game seems to run several cycles, ± 15 minutes in length after which it refreshes its resource pool.

Think of it like a literal pool filled with resources. From the top there are holes punched through down via slots that are a meter apart into the pool. These slots extract resources worth various amounts from the pool. Think of it like a graph from the side, you extract resources from a point on the graph from the top of the graph. Every 15 minutes depending on what new “liquid” resources were added to / removed from the pool, “solidifies” becoming new resources that can be extracted.

Depending on in which column the liquid resources were deposited, there may not be enough of it to solidify so the slot stays in its liquid form, unable to be extracted from until the threshold is reached.

as a developer i can’t understand why a loot algorithm would be constructed in this way. it seems needlessly complex. and needless complexity lends itself to the creator not understanding all the ways in which a system could be exploited.

Spiraling 8’s I tell you…

dude where’s my calculator ?

https://www.youtube.com/watch?v=Ws6HPTom2AY

[ul]
[li]Phi (φ): The golden ratio, approximately 1.618033988749895[/li][li]E (e): The base of natural logarithms, approximately 2.718281828459045[/li][li]Pi (π): The ratio of a circle’s circumference to its diameter, approximately 3.141592653589793[/li][li]Square root of 2 (√2): Approximately 1.4142135623730951[/li][li]Square root of 3 (√3): Approximately 1.7320508075688772[/li][li]Square root of 5 (√5): Approximately 2.23606797749979[/li][li]Euler–Mascheroni constant (γ): Approximately 0.5772156649015329[/li][li]Catalan’s constant (G): Approximately 0.915965594177219[/li][li]Apéry’s constant (ζ(3)): Approximately 1.202056903159594[/li][li]Feigenbaum constant (δ): Approximately 4.66920160910299[/li][li]Feigenbaum constant (α): Approximately 2.502907875095892[/li][li]Khinchin’s constant (K): Approximately 2.685452001065306[/li][li]Gelfond’s constant (e^π): Approximately 23.14069263277926[/li][li]Liouville’s constant (L): Sum of 10−n!10^{-n!}10−n! for n=1,2,3,…, approximately 0.110001000000000000000001…[/li][li]Chaitin’s constant (Ω): Represents the halting probability of a random program, varies but is approximately 0.007874996997812384…[/li][/ul]