102 lines
2.4 KiB
C++
102 lines
2.4 KiB
C++
#include "state.h"
|
|
#include <stdio.h>
|
|
#include <math.h>
|
|
|
|
int State::size = 19;
|
|
|
|
State::State( void )
|
|
{
|
|
board = new type[size * size];
|
|
}
|
|
|
|
State::~State( void )
|
|
{
|
|
delete[] board;
|
|
}
|
|
|
|
void State::printState( void )
|
|
{
|
|
int i,j;
|
|
for (i = 0; i < size; i++) {
|
|
for (j = 0; j < size; j++) { //for all points:
|
|
switch (board[i*size + j])
|
|
{
|
|
case BLACK:
|
|
printf("B ");
|
|
break;
|
|
case WHITE:
|
|
printf("W ");
|
|
break;
|
|
case BOARD:
|
|
printf("- ");
|
|
break;
|
|
}
|
|
}
|
|
printf("\n");
|
|
}
|
|
printf("\n");
|
|
}
|
|
|
|
State State::generateState (SDL_Surface *boardImg, Settings settings)
|
|
{
|
|
State state;
|
|
int i, j, x, y, r, sum, bpc, wpc;
|
|
point p;
|
|
r = 5; //what kind of magic number is this?
|
|
for (i = 0; i < size; ++i) {
|
|
for (j = 0; j < size; ++j) { //for all points:
|
|
p = positionPoint(i, j, settings); //retrieve the estimated point
|
|
sum = 0;
|
|
bpc = wpc = 0;
|
|
|
|
//TODO: this loop should be placed into its own function!
|
|
for (y = p.y-r; y < p.y+r; ++y) {
|
|
for (x = p.x-r; x < p.x+r; ++x) { //for -10 to 10 around the point
|
|
uint32_t px = PX(boardImg, x, y);
|
|
sum += (PXR(px) + PXG(px) + PXB(px)); //sum up the colors
|
|
if (PXR(px) + PXG(px) + PXB(px) < settings.getBlackTreshold())
|
|
bpc++;
|
|
if (PXR(px) + PXG(px) + PXB(px) > settings.getWhiteTreshold())
|
|
wpc++;
|
|
}
|
|
}
|
|
sum/=400;
|
|
//printf("%d\t", sum);
|
|
type t = BOARD;
|
|
/*
|
|
if (sum < settings.getBlackTreshold()) t = BLACK;
|
|
if (sum > settings.getWhiteTreshold()) t = WHITE;
|
|
*/
|
|
if (wpc > 10) t = WHITE;
|
|
if (bpc > 10) t = BLACK;
|
|
PX_(state.board, i, j, size, size) = t;
|
|
}
|
|
//printf("\n");
|
|
}
|
|
//printf("\n");
|
|
return state;
|
|
}
|
|
|
|
point State::positionPoint(int i, int j, Settings s)
|
|
{
|
|
point ul = s.getUL(), ur = s.getUR(), bl = s.getBL(), br = s.getBR();
|
|
point topp, botp, pp;
|
|
double alf = 1.1*((double)(br.x-bl.x))/(ur.x-ul.x);
|
|
double a = 2/(alf+1);
|
|
double jj = 0;
|
|
int n;
|
|
for (n = 0; n < j; n++)
|
|
jj += a+((alf-1)*a*n)/(size-1);
|
|
//printf("(%d, %d, %f)\n", i, j, jj);
|
|
topp.x = ul.x + (i*(ur.x-ul.x))/(size-1);
|
|
topp.y = ul.y + (i*(ur.y-ul.y))/(size-1);
|
|
botp.x = bl.x + (i*(br.x-bl.x))/(size-1);
|
|
botp.y = bl.y + (i*(br.y-bl.y))/(size-1);
|
|
pp.x = topp.x + (jj*(botp.x-topp.x))/(size-1);
|
|
pp.y = topp.y + (jj*(botp.y-topp.y))/(size-1);
|
|
//pp.y = topp.y + ((j-sin(j*(bl.y-ul.y)/(M_PI*(size-1)))/a)*(botp.y-topp.y))/(size-1);
|
|
//pp.y = topp.y + (j*(botp.y-topp.y))/(size-1);
|
|
return pp;
|
|
}
|
|
|