A snowman lives in a dangerous place. Its home is a tent. However, there are many locations with high intensity radiation. The snowman is going home but it does not know yet which lane is the safest. Our algorithm will make snowman decide the most optimal (safest) trajectory to the home (a tent).
There are several parameters that can be modified in this simulation.

• Grid Size (Integer)
• Start Point (Integer,Integer) - starting point of the snowman
• Finish Point (Integer,Integer) - location of the tent
• Number of Obstacles per Row (Integer) - At most n obstacles per row. Will be randomized.
• Number of episodes (Integer) - For training purpose. The more episode, the more chance to learn.