2009-02-24, 06:57 PM
@Stereo
Checking monster's HP is pretty linear, it goes from X to 0. Checking attack counts is a bit trickier IMO, as you need to identify the period where someone attacks frequently. It is analogous to the picking the highest sum sub-array from a given array. IIRC the best cost of that is nlog(n).
Overall, most of the solutions are bandaids. They need to come up with something concrete yet efficient (which I personally have little hope that Nexon would do). Generally, whatever they came up with before, it hurts legits more than hackers.
Checking monster's HP is pretty linear, it goes from X to 0. Checking attack counts is a bit trickier IMO, as you need to identify the period where someone attacks frequently. It is analogous to the picking the highest sum sub-array from a given array. IIRC the best cost of that is nlog(n).
Overall, most of the solutions are bandaids. They need to come up with something concrete yet efficient (which I personally have little hope that Nexon would do). Generally, whatever they came up with before, it hurts legits more than hackers.