This is a tiny little project wich the goal of the dots are to get to the green dot, the project uses an algorithm that tries to find the location of the green dot without actually knowing it The further apart the dot is from the green dot, the random-er its movement become in hope to get to the green dot.
Model learning rate - The speed the model learns, does however give innacuracy. When the algorithm thinks it has made a good move, it will branch. Branching basically means that it will look 50 steps forward and if it is closer to the green dot, it will use that path. If it is not, it wont use that path.
