Stripped ProjectAlchemy Source Code

hey @pro4never i was looking throught this thread and at one point u said that u would do some codeing/teaching for money can u pm me ur msn i wanna buy some teaching idc about u codeing it infact i just want ur help ill pay u a price/hour so add me on msn so we ca talk about a price i need swome dire help cause im starting C++ and other object oriented codeing in about 2 months for school Collage Ftw but basicly i want to go in there with some background knolage so im able to look smart Xd so PM me ur msn so we can talk

Quote:

Originally Posted by pro4never Keep in mind pull closest will be a method pulling all possible coords near you that are valid and then checking their distance vs target and returning the closest one. Assuming no large obstacles it will return the most efficient coord to move to each time.

If you are talking about your pull weights method it is in no way efficient.
Unless I'm completely blind(slight chance) the following code gives me a wacked out path.
EDIT: Yes, this works very well for going short distances, but not when your trying to travel from one end of BI to the other.


This is the path that it returns. This image is on a small scale, Same results given on a large scale.
[Only registered and activated users can see links. Click Here To Register...]

Quote:

Originally Posted by warning3 Lol im such a noob. How do I make it understand it? :S

I told you already in my previous post...

Quote:

Originally Posted by StarBucks If you are talking about your pull weights method it is in no way efficient. Unless I'm completely blind(slight chance) the following code gives me a wacked out path. EDIT: Yes, this works very well for going short distances, but not when your trying to travel from one end of BI to the other. PHP Code:         public static Coord PullWeights(Client C, Coord Where)         {             List<Weight> Weights = new List<Weight>();             Coord L = new Coord(C.MyChar.X, C.MyChar.Y);              Coord ToReturn = L;             try             {                 for (int Y = C.MyChar.Y - 17; Y < C.MyChar.Y + 17; Y++)                 {                     for (int X = C.MyChar.X - 17; X < C.MyChar.X + 17; X++)                     {                         if (C.MyChar.ValidDmap(C.MyChar.Map, (ushort)X, (ushort)Y))                         {                             Coord Z = new Coord((ushort)X, (ushort)Y);                             Weights.Add(new Weight(Z, (ushort)Distance((ushort)X, (ushort)Y, Where.X, Where.Y)));                         }                     }                 }                 int Dist = Distance(C.MyChar.X, C.MyChar.Y, Where.X, Where.Y);                 foreach (Weight I in Weights)                 {                     if (I.Dist < Dist)                     {                         ToReturn = I.Where;                         Dist = I.Dist;                         if (Dist < 2)                             break;                     }                 }             }             catch {  }             Console.WriteLine("Point: {0}, {1} Dist: {2}", ToReturn.X, ToReturn.Y, Distance(ToReturn.X, ToReturn.Y, C.MyChar.TargetCord.X, C.MyChar.TargetCord.Y));             return ToReturn;         }  This is the path that it returns. This image is on a small scale, Same results given on a large scale. [Only registered and activated users can see links. Click Here To Register...]

PxN already told us that PullWeight is not perfect but does provide the what u need. If you really think about efficiency, check distance function. It uses max of delta X and delta Y meaning cost of diagonal path is same as delta X and delta Y. You can change to more accurate function, but is it worthy to add unnecessary CPU cycles ? For the long distance, you can't really use this function. Consider A*. Or change distance function.

Quote:

Originally Posted by argon69 PxN already told us that PullWeight is not perfect but does provide the what u need. If you really think about efficiency, check distance function. It uses max of delta X and delta Y meaning cost of diagonal path is same as delta X and delta Y. You can change to more accurate function, but is it worthy to add unnecessary CPU cycles ? For the long distance, you can't really use this function. Consider A*. Or change distance function.

Yes. How's your A going?


<edit>
im already waiting 3 days for my thread to be approved. Fuck mods, can't you just fucking come on and approve it?

Quote:

Originally Posted by OELABOELA im already waiting 3 days for my thread to be approved. Fuck mods, can't you just fucking come on and approve it?

lol, just pm a mod like .Mio to approve it

Ok update guys, im getting 14 mob kills/sec and not dcing, who can go faster?

omg this is really fast
1 fs = 14*60= 840 kills lmao
this will be heaven :)

Quote:

Originally Posted by [GM] omg this is really fast 1 fs = 14*60= 840 kills lmao this will be heaven :)

You can test it on my proxy tomorrow (be sure you 1-2 hit KO to get that speed)

I'd suggest you pm a moderator and post it again. Just tell them you're sorry for posting it again but that it's been 3 days.

Chances are it got denied just cause they thought it was spam or something... Too bad conquer doesn't have more mods. Seems every time I come on I'm needing to report a bunch of posts.

Quote:

Originally Posted by pro4never I'd suggest you pm a moderator and post it again. Just tell them you're sorry for posting it again but that it's been 3 days. Chances are it got denied just cause they thought it was spam or something... Too bad conquer doesn't have more mods. Seems every time I come on I'm needing to report a bunch of posts.

Naw, just havent seen it.

Approved it.
Dos your proxy authenticate trough the proxy server as well?
Most likely easy to figure out but i cant just be arsed.

Quote:

Originally Posted by [GM] so why i don't see it anywhere?

Its on the first page on Bots and Macros.

I have started to work on Tao botting, its working ATM still a bit buggy but if someone needs few things just PM me :)

I develop in the shadows i didnt contribute much into this Tread cause i guessed that there would be some "leechers" wich act like "shemales" in common MMORPG until they have what they want they are nice and calm and in the moment there done with you.. There is no uglyer person for them than you wich helped them <.<

I really cant understand such behavior, i still thank p4n for this great release, even if some people are complaining about his work. At least this guy is nice enough to share in such a "community".

Give a Hand and they take your Arm. And try even to pull your legs too..

Well much said, Cheers :)

Quote:

Originally Posted by OELABOELA Ok update guys, im getting 14 mob kills/sec and not dcing, who can go faster?

Nice actually i got 5-6 kp/s with no DC, 10k kills at birdman :D, but yeah yours is indeed better...

I guess i check up what p4n hint us about TimeStamp's :D

Thanks Obela i never thought about implementing a kp/s system, now i have one :D Good to know whats going on <.<

Cheers

Quote:

Originally Posted by pro4never Timestamps are involved, yes. There is more to it then that though. Not really something anyone who has ever told me about how it worked would want me spreading though. Basically the concept involves either A: boosting or B: resetting the server timestamp for last jump so that you can jump again without delay.

Can we have more of this please? :D Is this Theory also working for Fatal??

Just a yes is enough, thanks :D

Cheers