This is based on a math problem I found that was given to 3rd graders in Vietnam. I wanted to see how many solutions there were so I made this program to test all 387,420,489 possible outcomes to see if any of them work. Towards the right of the screen are the possible solutions and to the left is the numbers I am trying and the original problem. The bottom left corner is a graph showing how often does it find a solution(Steeper = more; Flater = Less;).The "frame" of the graph will shift when necessary.The original problem was to fill in each of the blanks with a number 1-9. You must follow all order of operations. Controls - [c]=Clear [Flag]=Start Also, If you think you can make my script faster, cleaner, or better, go ahead and try. I tried my best to use comments in the script to explain what is happening.
This same math problem in Vietnam and where I got it (below). (http://www.quora.com/This-is-a-math-problem-that-was-posed-to-third-grade-students-in-Vietnam-how-many-solutions-are-there)
