     for(unsigned int i = 0; i < N; ++i)
     {
       // draw a sample from the unit square
-      float u0 = static_cast<float>(rng()) / minstd_rand::max;
-      float u1 = static_cast<float>(rng()) / minstd_rand::max;
+      float x = static_cast<float>(rng()) / minstd_rand::max;
+      float y = static_cast<float>(rng()) / minstd_rand::max;
 
       // measure distance from the origin
-      float dist = sqrtf(u0*u0 + u1*u1);
+      float dist = sqrtf(x*x + y*y);
 
-      // add 1.0f if (u0,u1) is inside the unit circle
+      // add 1.0f if (u0,u1) is inside the quarter circle
       if(dist <= 1.0f)
         sum += 1.0f;
     }


#include <iostream>


// we could vary M & N to find the perf sweet spot

struct estimate_pi
{
  __host__ __device__
  float operator()(unsigned int seed)
  {
    using namespace thrust::experimental::random;

    float sum = 0;
    unsigned int N = 10000;

    // seed a random number generator
    // XXX use this with uniform_01

int main(void)
{
  // use 30K independent seeds
  int M = 30000;

  float estimate = thrust::transform_reduce(thrust::counting_iterator<int>(0),
                                            thrust::counting_iterator<int>(M),
                                            estimate_pi(),
                                            0.0f,
                                            thrust::plus<float>());
