Cheat Engine

[chochang262]

I'm playing Bejeweled 3 and I decided I wanted to have some fun with it.

All the easy stuff to find like level completion and score are just to simple.

I figured that the game has to have a jewel id for each tile so that it could compare the adjacent tiles and if three or more are matching, trigger the correct effect.

So I would also assume that if I were to search for an unknown value of All types, and search for a changed value every time the tile in the 1x1 space changed a jewel (ex. clearing line under it and the jewels dropping down into the 1x1 as a different jewel) That I would Eventually end up with the ID of the jewel in the 1x1 space.

This would of course make it very easy to find the id's of the rest of the tiles, but my main goal was simply to figure out what the uber jewel was and be able to replace the jewel in the 1x1 with it.

However All of my searches end up with 0 results at the end.

On a similar note, I've also tried to find the location of the selected jewel as well by searching for a unknown value then selecting a different jewel and searching for a changed value.

I've also attempted to guess the selected tile assuming that the value would be in the form of coordinates (ex. 1x1 --- (1,1) ).

I'm not exactly asking for somebody to do this for me, but more like someone to help me out with a technique or something that I just might not be thinking of.

(Granted I might be completely wrong on the way this game is coded and the method of searching I'm using might just be completely wrong.) Any help is appreciated and sorry if this is the wrong section to post in, but it said help so I think this would be the right one.

[Zanzer]

Well it all depends how the game handles the board.

As you said, one way is to simply have a single array of every tile.
Each index is possibly a 0 for empty, 1 for type A, 2 for type B, etc.
In which case, your method should have been able to find it.

Another method is that each piece creates a new structure in memory when it appears.
So when a tile is cleared, those structures are freed from memory.
When a new line comes in, new memory structures are created.

To search this method, I would keep 1 tile present forever.
When the tile moves, then you search changed value.
So now you are searching that object's location on the board.

Of course, you only have so much time before that piece reaches the bottom and you lose.

[chochang262]

I see, thanks for the reply. What you said makes sense and I did not even consider that possibility. I'll try out the method you supplied Zanzer and post the results of it.
----------------------------------------------------------------------
EDIT: that method provided better results, however the information I gathered from it was highly minimal. I mainly only got something to do with how a specific piece moves on the board. If I even freezed the value for a second It would mess up the one location on the board often rendering it unmovable. however it was able to be broken and on occasion a new piece could move into it. Sometimes After the clear, that specific section would be fine, and the problem would transfer off to another location. This leads me to believe that either the structures are not actually deleted, but are reincarnated at the top as a new piece, or with every clear, all of the gems(even the ones not involved in the clear eg. did not even move because of it) are completely flushed and renewed. That would seem to be illogical and a waste of memory to me, but who knows. I've given up with this game, however as after my many trials through it have given me a huge sense of boredom now. I appreciate the help though.

If anyone would like to further comment and give me ideas however that would be fine seeing as it would only help me become better at doing anything in any other game as well in the future.