The point of the game is to put the dot into the target triangle in the smallest possible number of moves.
During the move, you must choose one of the vertices of the triangle. The dot will be moved half the distance from its current position to that vertex.
The maximum number of moves required to complete the game is always the number of iterations, which is the level you chose. If you complete the game in that number of moves, your score will be the maximum 100. Otherwise, the score will be decreased with every extra move.
This applet uses several methods and algorithms. We used generator iteration to draw the actual fractal and the random point method to choose the target triangle. There is a specific algorithm that will allow you to get 100 on any level. Can you find it?