convert and close AlgorithmsMeetup#9 from FarhadG to new format

MonteCarlo/participantSolutions/FarhadG.js

@@ -0,0 +1,46 @@
+/*
+  YOUR TASK:  To fill in the following function.
+
+  --- BASIC REQUIREMENTS ---
+    * It should return a number equal to the area of the shape.
+
+  --- EXTRA CREDIT ---
+    * Have the algorithm only halt after a certain degree of precision has been reached.
+    * Refine your algorithm to choose points in a "smarter" fashion.
+    * Dig into base.js and improve performance there.
+
+  --- AVAILABLE METHODS ---
+
+    The following methods are available to you in the global scope:
+
+      evalPoint: function(x, y)
+        -- Returns "true" if a point is inside the shape, and false otherwise.
+
+      getGraphDimensions: function()
+        -- Returns an objects with the dimensions of the graph.
+        -- Has properties x and y, each of which has properties min and max.
+           (ex. { x:{min: 3, max: 10}, y:{min:-5, max: 6} })
+
+  --- SOME THINGS TO THINK ABOUT ---
+    * Which shapes are easier/harder to integrate?
+    * What ratio of window size to shape size maximizes accuracy?
+    *
+*/
+
+var integrate = function() {
+
+  var counter = 1000, hits = 0;
+  var d = getGraphDimensions();
+  var width = d.x.max - d.x.min;
+  var height = d.y.max - d.y.min;
+  var area = width * height;
+
+  for(var i = 0; i < counter; i++) {
+    var x = Math.random() * width + d.x.min;
+    var y = Math.random() * height + d.y.min;
+    evalPoint(x, y) && hits++;
+  }
+
+  return (hits / counter) * area;
+
+};