summaryrefslogtreecommitdiff
path: root/src/Character.cpp
blob: 423a3425aa59b95e2dc7f94ae1fbd6139168d059 (plain)
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
#include "Character.hpp"

Character::Character(char nSymbol, int nColor, Location L)
{
    symbol = nSymbol; 
    color = nColor;
    l = L;
}

void Character::draw(WINDOW * w)
{
    wattron(w,COLOR_PAIR(color));
    mvwaddch(w,l.x,l.y,symbol);
}

Location Character::action(vector <Location> occupied)
{
        if(order == "wander")
        {
            Location Lo;
            int r = rand()%15+1; 
            if(r==1)
            {
                Lo.x = l.x+1;
                Lo.y = l.y;
            }
            else if(r==2)
            {
                Lo.x = l.x-1;
                Lo.y = l.y;
            }
            else if(r==3)
            {
                Lo.x = l.x; 
                Lo.y = l.y+1;
            }
            else if(r==4)
            {
                Lo.x = l.x; 
                Lo.y = l.y-1;
            }
            else if(r==5)
            {
                Lo.x = l.x+1; 
                Lo.y = l.y+1;
            }
            else if(r==6)
            {
                Lo.x = l.x-1; 
                Lo.y = l.y-1;
            }
            else if(r==7)
            {
                Lo.x = l.x+1; 
                Lo.y = l.y-1;
            }
            else if(r==8)
            {    
                Lo.x = l.x-1; 
                Lo.y = l.y+1;
            }
            else
            {
                Lo = l;
            }
            
            //move(Lo);
            
            if(check(Lo,occupied))
            {
                move(Lo);
                return Lo;
            }
            else
                return l;
        }
}

bool Character::check(Location L, vector <Location> occupied)
{
    for(int i = 0; i < 10; i++)
    {
        if(L.x == occupied[i].x && L.y == occupied[i].y)
        {
            return false;
        }
    }
    return true;
}