Gilly-Oso

Thanks to trial and error an address map for the 5 resource values have been resolved and so a matching algorithm sorts out the actual corresponding addresses for each resource provided at least 2 resources have been selected for the "search". All this is really doing is automating the tedious process of searching for the values of at least 2 resources then applying an address displacement map (the trial and error one) to locate the remaining (3) resources. The address displacements are in the code but the actual addresses are different on every run which is why we need to "search" for them (and run the script) every new instance of the game. Thankfully the address displacements are always the same, as simple data structures should be.