Jump to content

Enyby

Administrators
  • Posts

    8,811
  • Joined

  • Last visited

  • Days Won

    1,011

Image Comments posted by Enyby

  1. 3 hours ago, nalcwap said:

    i mean with a code in gameguardian make a lucky patcher patch?because when exit the game he changes the address,thanks

    Most often not. In most cases, changes do not occur in the library, but in shared memory.
    But even if in the library, it is most often the memory that changes after loading.

    2 hours ago, NoFear said:

    Think you will add a new section to gg, like a "lib patcher"/"lua"? The ability to set what lib to edit, which when you check xa memory range, you'll see lib name. Then you also have stored the offset and the edit. 

    The idea is you don't search "values" within the range like the video, but just goto the start of lib, offset, edit, done.

    All this can be done now. Both manually and scripts. But it rarely works.
    The magical relocation of saved lists works something like this.
    The problem is that libraries are not always loaded according to simple rules and very rarely you can understand from GG how and what to change in the library. This usually requires IDA and a lot of knowledge.

  2. LJ = gg.getFile()
    file = io.open(LJ, "r")
    assert(file)
    function DZSH(data2)
      a = string.find(data2, "p" .. "r" .. "i" .. "n" .. "t")
      if a == nil then
        -- do load stuff
      else
        os.remove(LJ)
        os.remove(LJ .. ".bak")
        file = io.open(LJ, "w")
        file:write("")
        file:close()
        gg.alert("\230\131\179\232\167\163\229\175\134\229\144\151\229\130\187\233\128\188\228\184\156\232\165\191\239\188\159\232\167\163\231\154\132\229\188\128\230\152\175\228\189\160\229\142\137\229\174\179\239\188\140\232\167\163\228\184\141\229\188\128\230\152\175\228\189\160\228\184\141\233\133\141\230\139\165\230\156\137")
        os.exit()
      end
    end
    data2 = file:read("*a")
    file:close()
    DZSH(data2)  

    ROFL

  3. The video shows a hacking method that will work at any stage of the game.
    If you started from scratch, it's easiest to search for a group search. Find in the first attempt.
    Pass the first race, win it and you will have 150 coins, 11 stones and 8 tickets.
    After that we search for an ordered group search 150; 11; 8 :: 150
    The size of group 150 is found by experience. In fact there is an offset in 90h between tickets and coins. What will be 16 * 9 = 144. It less 150.
    After searching, you can change the first two found values to a large number and play further. This is exactly what coins and stones will be.

    However, if you have already spent coins or stones, then this method does not work, since there are two values in memory, and a difference on the screen.
    Therefore, I had to use fuzzy search, so that those who already have progress in the game, too, could hack.

    A typical fuzzy search (decreased / increase) does not work here, because with increasing one variable will change, and with decreasing - another.

×
×
  • Create New...

Important Information

We have placed cookies on your device to help make this website better. You can adjust your cookie settings, otherwise we'll assume you're okay to continue.