Cheat Engine

[nog_lorp]

For computers with good storage capacity, this would be a cool feature, an alternative to the normal scanning paradigm of creating a criteria, filtering by that criteria, and reducing the set with each subsequent search.

Instead, take a snapshot of the program memory every time requested by the user. Then, results can be generated from these files using the standard scanning procedures.

This has the advantage of allowing and possible combination of searches to be performed on the same memory, as well as allowing pseudo-instant scanning: snapshots could theoretically be taken faster than searches would have been completed, removing the forced delay between scans caused by scan times.

~nog_lorp

[Dark Byte]

this will be a lot slower than memory scanning from an active process since the bottleneck in memscanning actually is the speed of the harddisk, not the memory. Saving a snapshot to disk takes 8 times longer than reading through the memory and only saving the matching addresses to disk

also, because it's a snapshot scanning for changes or increased values is impossible

[nog_lorp]

Couldn't the snapshot be stored in memory instead? How would this compare speed-wise?

Also, the idea is to take several snapshots, and then perform scans as if each snapshot was the memory at the moment. So then, you would say "Snapshot 1: Unknown Value, Snapshot 2: Increased ...".

~nog_lorp