C / C++ / MFC

#include <stdio.h>
#include <time.h>

#define SECONDS_PER_DAY 86400

int main()
{
    time_t current_time;
    char* c_time_string;

    current_time = time(NULL);
    current_time = current_time - 2 * SECONDS_PER_DAY;

    /* Convert to local time format. */
    c_time_string = ctime(&current_time);

    printf("Current time is %s\n", c_time_string);

    return 0;
}

int miniMax(char wnr, int deep)//Minimax
{
	if (controlloVincita(2))//control win
		return INT_MAX;
	if (endgame())
		return INT_MIN;
	int i, j, res, tmp;
	
	if (wnr == 1)//se giocatore massimizzante
	{
		res = 1;
		for (i = 0;i<M;i++)
			for (j = 0;j<N;j++)
			{
				if (BOARD[i][j]==0)
				{
					BOARD[i][j] = 1;
					if (controlloVincita(1))
						if (deep == 20)
						{
							BOARD[i][j] = 0;
							return INT_MIN;
						}
						else
							res -= 2;
					else if ((tmp = miniMax(2, deep - 1))<res || (tmp == INT_MIN))
						res = tmp;
					BOARD[i][j] = 0;
				}
			}
	}
	else
	{
		res = -1;
		for (i = 0;i<M;i++)
			for (j = 0;j<N;j++)
			{
				if (BOARD[i][j]==0)
				{
					BOARD[i][j] = 2;
					if (controlloVincita(2))
						res += 2;
					else if ((tmp = miniMax(1, deep - 1))>res || (tmp == INT_MAX))
						res = tmp;
					BOARD[i][j] = 0;
				}
			}
	}
	return res;
}

int get_next_move(unsigned int *i, unsigned int *j)
{
	int max = INT_MIN, mi = 1, mj = 1, t;
	int alfa = INT_MIN, beta = INT_MAX;
	for (*i = 0;*i<M;(*i)++)
		for (*j = 0;*j<N;(*j)++)
			if (BOARD[*i][*j]==0)//matrix empty
			{
				BOARD[*i][*j] = 2;//first player 
				t = miniMax(1, 20);//recursive minimax
				if (t>max)//
				{
					max = t;
					mi = *i;
					mj = *j;
				}
				BOARD[*i][*j] = 0;
			}
	
	BOARD[mi][mj] = 2;//save the computer move
	*i = mi;
	*j = mj;
	return 1;
}

union MyDef
{
    DWORD W1;
    struct bits
    {
        DWORD B1 : 8;
        DWORD B2 : 8;
        DWORD B3 : 8;
        DWORD B4 : 8;
    };
};