richie86 Grandmaster Cheater
Reputation: 0
Joined: 13 Jan 2006 Posts: 664
|
Posted: Fri Jul 28, 2006 12:01 am Post subject: |
|
|
DB i had one idea on helping in searching a memory.
It basically like the example below.
When I search an 4 byte unknow value, it return 4000 result.
I add this 4000 result to a group let say "Result A"
then i search next with decreased value,
then i use the new function to compare with Result A.
and i get my new result.
It can be a value change from
First scan: 100 at 4001C5
Next Scan: 80 at 4001C5
Third Scan: 100 at 4001C5 (we use the function to know they return back to the value as in result A)
this can help much to discover new hack lol
_________________
|
|