Cheat Engine

[creo]

I am trying to find a solution to achieve what is stated in the subject.

To put the scenario in perspective, I have a known 8 byte value that is unique to a particular mob. This value can occur several hundred times within the game memory. I am looking for another value that is not known, but will change under certain circumstances. Performing this through normal brute force alternating compares takes several iterations to reduce the count from several hundred million (yes I said million) down to a few 10's of thousands. Over time, this number can be finally reduced to several hundred, but this is still too many for a manual view to filter the results.

I would like to be able to perform a search for an unknown initial value and then perform a second search when the value should have changed and then filter these results to only include those addresses that are within a certain proximity of my known value.

I have considered possibly using Lua, but have not yet delved into using it with CE and I am not sure that would be the best approach to achieve my goal. So, I am looking for suggestions.

Any ideas would be welcomed...

Cheers,

creo

[Dark Byte]

Is this secondary value at a set distance of the known 8 byte value?
If so, I think a custom type can be used here

Set the size of the custom type to encompass the whole block (8 byte + ignored bytes+changing value)

Then on compare check if the 8 byte value is what it should be. If so, return the secondary value, if not, return 0 (or another value you can check for that it's invalid. Prime numbers tend to work well)

then when scanning you can do a changed/unchanged scan and then do a scan whee the value is not the value you picked as a "wrong value"



You'll need a fixed ce for custom scan to scan unknown initial value: http://cheatengine.org/temp/CheatEngine62Beta4.rar

[creo]

Thanks for the update. I will check this out and see if I can get what I need...

I am not sure the unknown value will always be within a fixed distance of a known value in all cases, just within an approximate distance and could be either before or after the known value in some cases...

However, this will give me something that will allow me to track down values for cases where I can provide a distance...

At times, I find structures that have my known value and then have a value that I think could be useful in which case I would know the distance between them. Using this, I can then track down similar structures for other entities where I know the fixed value but want to see if a similar structure exists and if so, what the unknown value is in this case...

I appreciate the suggestion and the patched binary...

Cheers,

creo

[arnold1]

i am glad to see your post very touchy post u have shared thanks for sharing God bless u