Did anyone make a script for Malatina Course of terror? Is it event possible to make one?
Since they fixed it in some patch ago i did not play it cause u have to be pretty lucky to go through...
But its solvable, only a pain in the ass... If theres a way to make a script for it or some of you already have one i would really appreciate one or at least some help making one happen... main problem is that the bot would have to check possible (and fastest) exits of the stage, which i just dunno how to make :/
map is always the same, what changes is the layout of different bricks to destroy to go through... each brick is destroyed differently, some u just can't destroy by yourself layout is 5x6 bricks, the problem is to calculate the easies/possible/fastest way to the exit, to be honest, since it takes only couple of minutes i'd be willing to do it myself, but i always have problems making "math" to find that best route...
Types of bricks to make it easier:
cannon - you click on it and a cannon appears that u can shoot another brick to destroy it
wall - you go near it and a wall appears, its undestoyable by a player, need a cannon to go through
thorn-wine - you go near it and a wall of thorn-wine appears, u need to harvest it go back to fire it up (also harvest function) and then go back and fire it to destroy
key - you click on it and then once more, you gain one key then (which you open chests with) need to get to all key bricks before u leave each of the 4 rooms in this mini game
clown - you go near it and a gate with a clown mob that attacks you appears, you need to attack the gate not the clown
gate - you click on it and a gate appears, when you go through it u come back to the entrance to the room you are in, tip, you can go through that gate and not get teleported (so you can assume that its not there if u go in a strait line)
PS. there are 4 rooms to go through, and making each of them in less that 3 minutes give u 2 extra precious keys, to be honest if u wont get those extra keys the run is just a waste of time in 90% of times
Assuming they all have different IDs, you would be able to tell which path takes the least time to get through (on average). Can you give me a cheap map of what this would look from above?