Talk:Dragon Track/@comment-108.172.210.41-20120819073035

I have derived an algorithm for winning a gem every single time, I need some more data from you guys to fully debug it.

The algorithm is titled "Counterclockwise roulette method based on minimum threshold energy". The concept is simple, the roulette has 12 slots and requires a "minimum threshold energy" to activate. If the energy released by your finger while swiping the roulette does not meet the minimum threshold energy, the roulette will simply move one slot in the direction of your finger and will not rotate. This way, you can see all the slots of the roulette by swiping extremely slowly one slot at a time. (This is a simple if-else statement implemented in Object-C).

The method has been derived through statitistical analysis that is largely based on the error between the pivot slot and the result slot, the error is not random and can be minimized from |e|<=4 (meaning that the resulting slot is 4 spots away from the pivot slot during a counterclockwise swipe) to |e|<=2.

You guys can try out this method and see if a pattern emerges, the trick here is to activate the minimum energy required to activate the roulette. The energy requires has been discretized (maybe very finely) for the if-else blocks, therefore controlling your swiping speed will lead to a pattern.