/**
*
* Copyright (C) Tyler Hackett 2016
*
* CUDA Triangle Counter
*
* A quickly-written program to determine all possible combinations of
* valid triangles from a grid, allowing for certain coordinates of the
* grid to be marked as unusable.
*
* main.h
*
* */

#define GRID_WIDTH 4
#define GRID_HEIGHT 4

const uint2 h_invalidPoints[] = { { 0, 0 } };

__global__ void countTriangles(uint2 *validPoints, int *count);

bool isInvalidPoint(uint2 p);

/**
*
* Copyright (C) Tyler Hackett 2016
*
* CUDA Triangle Counter
*
* A quickly-written program to determine all possible combinations of
* valid triangles from a grid, allowing for certain coordinates of the
* grid to be marked as unusable.
*
* main.h
*
* */

#define GRID_WIDTH 4
#define GRID_HEIGHT 4

const uint2 h_invalidPoints[] = { { 0, 0 }, { 0, 3 }, { 3, 0 }, { 3, 3 } };

__global__ void countTriangles(uint2 *validPoints, int *count);

bool isInvalidPoint(uint2 p);

Set up parameters to coincide with Java counterpart
Set up parameters to coincide with Java counterpart
