PuissanceN/AIutils.cpp at master · ANDREMIV/PuissanceN · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
#include <stdio.h>
#include <stdlib.h>
#include "game.h"

///returned pointer must be freed even if nb_move is 0 !
int* find_possible_moves(int* nb_move, const struct Game G)
//returned pointer stores the row of the ieme possible row
{
    int nb=0;
    int i,row_nb=G.rownb;
    for(i=0;i<row_nb;i++)
            if(LinesFree(i+1,G))
                nb++;
    int* ptr=(int*) malloc(nb*sizeof(int));
    int a=0;
    if(nb)
    for(i=0;i<row_nb;i++)
            if(LinesFree(i+1,G))
                ptr[i-a]=i+1;
            else ++a;

    *nb_move=nb;
    return ptr;
}

///return next possible row to play after previous row
int nextmove(int prow,const struct Game G)
{
    int i,row_nb=G.rownb;

        for(i=prow;i<row_nb;i++)
            if(LinesFree(i+1,G))
                return i+1;

    return 0;
}

choosemaxrow(int *rs,int nb_pmov)
{
    int *row_scores=rs;
    int i; int lmax=*row_scores; int imax=0; int occ=0;
                    for(i=0;i<nb_pmov;i++) ///Choose row with max score
                        if(row_scores[i]>lmax)
                        {
                            lmax=row_scores[i];
                            imax=i;
                            occ=0;
                        }
                        else if(row_scores[i]==lmax)
                            occ++;
                    if(occ) ///Choose randomly between max score rows
                        {
                        int a=rand()%(occ+1);
                        for(i=0;i<nb_pmov;i++)
                        if(row_scores[i]==lmax)
                        if(a)a--;
                        else return i;
                        }
                    return imax;
}