#include "board.h"
#include "checkouts.h"
#include "comp.h"
#include "match.h"

#include <math.h>
#include <stdbool.h>
#include <stdlib.h>

double horizontal_stdev = 16, vertical_stdev = 16;

static double drand()
{
	return (double)rand() / RAND_MAX;
}

static double gauss(double mean, double stdev)
{
	static bool have_next;
	static double next;
	double curr;

	if (have_next) {
		curr = next;
	} else {
		double theta = 2 * M_PI * drand();
		double r = sqrt(-2 * log(1 - drand()));

		curr = r * cos(theta);
		next = r * sin(theta);
	}

	have_next = !have_next;
	return mean + (curr * stdev);
}

static struct ccoords get_offset()
{
	return (struct ccoords){ .x = gauss(0, horizontal_stdev),
		.y = gauss(0, vertical_stdev) };
}

struct ccoords pol_to_cart(struct pcoords c)
{
	double t = c.a * (M_PI / 180);
	return (struct ccoords){ .x = c.r * cos(t), .y = c.r * sin(t) };
}

static struct pcoords cart_to_pol(struct ccoords c)
{
	return (struct pcoords){ .a = atan2(c.y, c.x) * (180 / M_PI),
		.r = sqrt(pow(c.x, 2) + pow(c.y, 2)) };
}

static struct pcoords throw_dart(struct pcoords target, struct ccoords *cc)
{
	struct ccoords tc = pol_to_cart(target);
	struct ccoords offset = get_offset();

	cc->x = tc.x + offset.x;
	cc->y = tc.y + offset.y;

	return cart_to_pol(*cc);
}

struct segment next_dart(int rem, int darts_in_hand)
{
	char *c = NULL;
	if (rem <= NUM_CHECKOUTS)
		c = CHECKOUTS[darts_in_hand - 1][rem - 1];
	if (!c && rem <= NUM_SETUP_SHOTS)
		c = SETUP_SHOTS[rem - 1];
	if (!c)
		c = "T20";

	return segment_from_name(c);
}

void comp_visit(struct leg *l)
{
	struct visit *v = leg_visit(l);
	v->darts = calloc(3, sizeof(*v->darts));
	v->ccoords = calloc(3, sizeof(*v->ccoords));

	for (int i = 0; i < 3; ++i) {
		struct segment ts = next_dart(l->rem - v->points, 3 - i);
		struct pcoords tc = segment_centre(ts);

		struct ccoords dcart;
		struct pcoords dc = throw_dart(tc, &dcart);
		struct segment ds = segment_from_pcoords(dc);

		v->ccoords[v->n_darts] = dcart;
		v->darts[v->n_darts++] = ds;
		v->points += segment_points(ds);

		if (l->rem - v->points == 0 && segment_is_double(ds))
			break;

		if (l->rem - v->points <= 1) {
			v->points = 0;
			break;
		}
	}

	l->rem -= v->points;
	v->rem = l->rem;
}