APSD-project/CA_seq.cpp at main · markducks/APSD-project · 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
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
#include <stdio.h>
#include <stdlib.h>
#include <chrono>
using namespace std::chrono;

#define NCOLS 120
#define NROWS 180
#define NGENS 3500

#define v(r,c) ((r)*(NCOLS) + (c))

int* readM;
int* writeM;

void init(){
    for(int i=0; i<NROWS; i++){
        for(int j=0; j<NCOLS; j++){
            readM[v(i,j)] = 0;
        }
    }
}

void initRandomCA(){
    //Random initialization of Game Of Life
    for(int i=0; i<NROWS; i++){
        for(int j=0; j<NCOLS; j++){
            readM[v(i,j)] = rand()%2;
        }
    }
}

void initLWSS(){
    for(int i=0; i<NROWS; i++){
        for(int j=0; j<NCOLS; j++){
            readM[v(i,j)] = 0;
        }
    }

    readM[v(1,2)] = 1;
    readM[v(1,3)] = 1;
    readM[v(1,4)] = 1;
    readM[v(1,5)] = 1;
    readM[v(2,1)] = 1;
    readM[v(2,5)] = 1;
    readM[v(3,5)] = 1;
    readM[v(4,4)] = 1;
}

inline void transFuncCell(int i, int j){
    int nNeighbors = 0;
    nNeighbors += readM[v(i-1,j-1)];
    nNeighbors += readM[v(i-1,j)];
    nNeighbors += readM[v(i-1,j+1)];
    nNeighbors += readM[v(i,j-1)];
    nNeighbors += readM[v(i,j+1)];
    nNeighbors += readM[v(i+1,j-1)];
    nNeighbors += readM[v(i+1,j)];
    nNeighbors += readM[v(i+1,j+1)];
    if(readM[v(i,j)] == 1){
        if(nNeighbors < 2 || nNeighbors > 3){
            writeM[v(i,j)] = 0;
        }
        else{
            writeM[v(i,j)] = 1;
        }
    }
    else{
        if(nNeighbors == 3){
            writeM[v(i,j)] = 1;
        }
        else{
            writeM[v(i,j)] = 0;
        }
    }
}

inline void transFunc(){
    for(int i=1; i<NROWS; i++){
        for(int j=1; j<NCOLS; j++){
            transFuncCell(i,j);
        }
    }
}

void swap(){
    int* temp = readM;
    readM = writeM;
    writeM = temp;
}


int main(int argc, char *argv[]){

    readM = new int[NCOLS*NROWS];
    writeM = new int[NCOLS*NROWS];

    init();

    initLWSS();

    auto start = high_resolution_clock::now();

    for(int i = 0; i < NGENS; i++){
        transFunc();
        swap();
    }

    auto stop = high_resolution_clock::now();
    auto elapsedTime = duration_cast<microseconds>(stop - start).count() / 1000000.0;
    printf("Time elapsed: %f seconds\n", elapsedTime);

    return 0;
}