Skip to content

multi target search and pointer chain edit with memory explorer

Compare
Choose a tag to compare
@tomvita tomvita released this 08 Jan 16:49
· 145 commits to master since this release

A new version to celebrate the new year.
May this new version let you find code faster and perhaps discover more cheats.

Multi target search for fast convergence when you know the structure of the target in memory.
Examine the memory structure with memory explorer and take note of some of the properties,
use multi target search when you want to find the target again when the memory location changes.

When you have found pointer you can move up and down the chain and create new chain
to target other memory locations of interest.

Now support negative offset for pointer chain.

PS: Multi target search is only for first search. Still considering if is good to also apply to subsequent search.

How to use these new features:
I use the game The Hong Kong Massacre as example
After firing some shots search for number of shots fired. After some iteration the memory location of interest is found.
Add this memory location to bookmark. Go into memory explorer with Rstick click.
2021010922472200-CCFA659F4857F96DDA29AFEDB2E166E6Look at the memory structure. Play a bit more and notice that the number next to shot fire is shot missed and after that is shot that hits enemy. Take note of the 128bit alignment of these numbers. This information can be used with multi target search to quickly find the memory location again.
2021010923000900-CCFA659F4857F96DDA29AFEDB2E166E6Enable the "use extra search value" option

Now the first search screen looks like this
2021010923081900-CCFA659F4857F96DDA29AFEDB2E166E6Enter the offset of the three items that you can easily know into this table. Move the cursor and press L, R or A to set the parameters. ZL+A let you enter a label(optional). X let you turn on/off the line. ZL+"+" let you mark the target. Press + will start the search.
With this search you get to find the target very fast, maybe even just one search. The search setup is stored in multisearch.dat can be shared with others to quickly find the value of interest for cheating when pointers can't be found.
2021010923080500-CCFA659F4857F96DDA29AFEDB2E166E6In this example I found only two candidates.
2021010923180200-CCFA659F4857F96DDA29AFEDB2E166E6One look at the second candidate it is easy to tell that it is not the right one.
Find pointer to this memory location the usual way. Now import it to bookmark. Rstick click on the bookmark and you are ready to explore the pointer chain.
Pressing L and R moves the [ ] bracket around. As you move the cursor the value inside changes.
2021010923252300-CCFA659F4857F96DDA29AFEDB2E166E6I have moved the cursor to missed. Pressing + to add bookmark will create a bookmark for missed which you can add to code later. Do the same with hits. Now you have create two additional codes effortlessly.
2021010923314900-CCFA659F4857F96DDA29AFEDB2E166E6Press L move up on level of the chain. There is a cluster of pointers. Let's see where they lead.
2021010923321800-CCFA659F4857F96DDA29AFEDB2E166E6Move the cursor down and press Y. Now the chain has changed. Press R to go down one level. This structure looks very similar to the one we found earlier.
2021010923360300-CCFA659F4857F96DDA29AFEDB2E166E6
It looks like there is one for each level.
We have found the level stats. Looks like it gets updated as we play. All the stats are cluster together. The four floats are the timings.
There is one of these for each stage.
2021011000171900-B33892687099617993FBD4BC2A29F663