Cheat Engine

Alachas · How do I cheat? Reputation: 0 Joined: 08 May 2015 Posts: 6

I just had a quick question that I'm hoping someone can answer...

When you run a pointer scan, you are able to close the program you are scanning once the progress bar has finished. I was wondering, can you do the same for a re-scan? I would assume so, but would hate to find out the hard way after having waited several hours!

Dark Byte · Posted: Sun May 10, 2015 4:30 am Post subject:

no, not in 6.4.
while the rescan eventually ends up with a full game copy (worst case scenario) not all parts of the target get copied at the same time, it's possible that the last pointers in the list could access completely different regions so ce woukd then have to copy that as well, and if the game is closed then rescan will assume it's unreadable, thus invalid

but you can in the next version where scans and rescans can be done on snapshots

tip: you can pause the game so it won't eat cpu cycles and if you:re low on memory windows will have an easier time paging it out to disk

Alachas · How do I cheat? Reputation: 0 Joined: 08 May 2015 Posts: 6

Ah-ha, thanks for the response Dark Byte! I'll just keep the game paused, then Smile

Looking forward to the next version!

Alachas · How do I cheat? Reputation: 0 Joined: 08 May 2015 Posts: 6

I was wondering if you could explain why the "rescan" takes so long, Dark Byte?
My first pointer scan found a veritable shit-zillion addresses, but only took about 6 hours. Now I'm doing a rescan with the new address and it appears to only be about 15% done and has taken 4 hours so far.
I assumed that a rescan would be quicker as it would essentially just check each pointer that was found in the initial scan and check that the address it points to is the new address?

Dark Byte · Posted: Mon May 11, 2015 3:18 am Post subject:

a pointerscan only has to check the last node in an itteration to see if it's valid (else it would not have gotten that far), but the rescan has to check every node of a pointer if it's valid.

next ce version can help with this as well by adding a rescan on a snapshot during the initial scan, which will limit the number of resuls exponentially(still involves verifying every node when a pointer is found, but may be faster if the hard disk is the limiting factor)