Quote:
Originally Posted by MaxGunz
Could just use a number of bitmasks and cycle through them. Mask logic, like shift operations, eats far fewer cycles than integer or floating-point math.
|
Now I have to agree, given the mask cycle is long enough to generate near random results.
And it could resolve the rookie 1000times as accurate than ace. Just mask/shift the same decimal positions and use different max deviation limits, e.g. an ace mask allows for 0F as max deviation, while the newbie mask allows for say 4F max.