Cheat Engine

[Tien_huong2002]

We have classic searching pointer methods:"find out what ...",and "pointer scanner" .And we've encountered "weakness" of "old method" above:
~1~ "Pointer scanner": we do nothing.But PC do many and many more.... Because of function's algorithm .If use this function for REAL_GAME is IMPOSSIBLE ! wait & wait for a few hours or days ?
=> this isn't intelligent way to search pointer high level !
~2~ "find out what ..." : we work a little and PC work "a little".This is simple track way => this is intelligent way to search pointer high level ! We should begin here! But we work look like a machine .So Update from this function is very useful & convenient for user ! If you reviewed the tut of pointer high level in CE.Do you feel it's easy? Yes ,I think so ...only in simple games. But in fact , We often use CE for REAL_GAME or BIG_GAME :
=> pointer of each searching step is very many ! ~150 addresses. So someone WANNA sit & "find out what ..." for them "one after another" ? This is very waste time ! And Challenge our patient !If our choice is use pointer ,this is a great problem !
Although i know we have some others ways to solve (not use pointer,we use code cave).But sometime pointer is easier to control object than code.
For example: Hack HP game WW2 Tank commander.We found a code decrease our HP .But NOP it will result in a GOD MODE for any Object (include Enemy ! ) Disassembler it location .We see it function name is decease HP =>oh this right ! But how to discriminate between our & Enemy ? this is another major !
Now let's see my picture to understand my idea Auto Branch (by your remote hotkeys ) :
-1- Differentiate offsets:
opcodenum1.jpg
-2- Get different offsets (Smart for this step):
opcodenumdisp1.jpg
-3- CE auto_search for each result then add them to finding process:
autosearcher1.jpg
-4- filter and return in ways of step 1:
autosearcher2.jpg
.............................................
-5- What result is green will be add to result list (looks like pointer searcher)And to table !

see! this is a simple idea But Not simple to complete it by programing ! right?
But if this function available . We can get all pointer Available ! very great!
So some pro man can help? this have a little complex .
If Dark Bytes read this topic,can you check your mail ? i'd already send a letter to you about this update !
Có bạn nào Việt Nam giúp giùm nhé ! Trình độ Anh Văn mình kém lắm !

[Dark Byte]

I don't understand what you mean fully, but ce 55.4 has 2 alchoritms for finding pointers.
default and the reverse pointer scan

I think the reverse pointer scan sounds a bit to what you want but not sure

[Tien_huong2002]

At first I means : Classic method for searching pointer , still have " some trouble":
-1- "Find out what ..." : this is a track method =>good ways .But In fact : we always plays REAL_GAME (big games) ,each searching step for pointer(high level) are a large result of addresses. So we must sit and track each of them . As my means : this is big game . Each step often have more than [2 offset type] or many more address results . So User Can't Manage them ! then become discouraged !Or CANNOT Find for a Green result !
-2- Pointer scanner : my means it's too slow searching method .


And my update ideas are Update "pointer scanner" and coordinate with tracker ("find out what...") this is a "semiautomatic" function.
Why i call it is semiautomatic ?
=="semi-" manual step by hot key ==
--+my hotkey:
ctrl+y :start tracking an address in list
ctrl+u :Stop tracking that address then auto start sequential searching for the offsets received (search for next level-pointer) (the algorithm i've send you in my mail).Auto play a sound when all searching completed

And how about a result that CE still not understand offset?
This is our work : fill in the message of CE (CE will ask you for the right offset)
So now you known why i call it's semiautomatic ?

let's see my "autosearcher1.jpg" that is a tree and branches .The structure ingredients :addresses and offsets .very clearly right ?

How about Filter addresses and offsets:
+ Addresses:So what will happen when ctrl+y then ctrl+u but nothing offset we got
=>CE will auto delete that address (it isn't satisfy) and play a sound too (this only a token for user for next step: press ctrl+y and change the value investigating).
+Offsets:
-+When found nothing for this offset (address - offset = value P;auto-search for Value P in hex but found nothing )
-+Found some addresses for this offset .But all there addresses are not satisfy (told above). (example: offset 18h in my "autosearcher2.jpg" )

This is looks not better than old method .But at least it faster than and Manage_able for Complex pointers high level!

I've just walk on internet and found an appropriate name of my method: "automatic back-tracking down to the root pointer" (get this name in memory hack soft)

In short:My idea is searching pointers base on : Tracking back
But your Pointer scanner is searching pointers base on: Scanner =Slower or VERY SLOW ! I'll never chose this way for searching pointer.
But classic "tracking back" is a mechanical work ! we ONLY Work in complex step (fill the complex offset that CE still not understand it).OR decide cancel searching a branch that CE detect it is inductive branch.


And Dark Bytes told me about "reverse pointer scanner" ! I don't really understand about this function. Do you have any full help about all feature of CE ?

Other question: What is Auto-assembler? i don't see this in internet and different with others ASM ?

Do you have any full guide about this major?
This very useful to use CE. At least,in Custom search .
sorry for my questions !
My idea is useful . But build it in CE is another problem ! right ?