Cheat Engine

[iPromise]

Can somebody tell me if i'm correct and help me out a little please ?

For an Unknown Initial Value scan, I must record down each address being used with its value into a buffer. Then if I do a Changed Value Scan, I must read that buffer which I stored the values inside, and see if it still equals the same value as it did before, if it equals the same value as it did before I do not add the item to the list.

BUT.

Won't it be slow, just the Unknown Initial Value scan itself, it would be amazingly slow, right? Or would it be fast because we're not doing any checking, we're just storing each address with its value down?

I did some trial and error myself and found the process to be quite slow, if anyone can tell me if the way I do things is right or not, and give me some advice on how to improve, would be appreciated

Thanks in advance.

[Dacnomania]

I don't know what you mean with the text above "BUT".

Unknown initial value is quite slow, But that depends on your PC performance, though mainly the 'value type' you're using.

'All (byte to double)' will take much longer than '4 bytes'.

Bottom line: If you want to find a value but don't know what it is, use 'unknown initial value'. The little time you'll wait is short enough for you to hold your breath.

[Slugsnack]

I'm not sure how CE implements it. Maybe for a single type your method is okay. Like the poster above said, who I believe misunderstood the question, all types would be slow. Your method does not work in reality though I believe. The buffer would need to be too large in some cases and you would be unable to allocate so much memory. I would advise doing the same thing but writing to a disk file. For 'all types' I think I would just copy all the memory into a memory mapped file. I'm not sure if it would be faster but pretty sure it won't be slower than using a regular file. With a MMF you could possibly preserve the address/value mapping as well. Although again I don't know if this is efficient.