bot_explodus/Location.h at master · explodus/bot_explodus · 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
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
#ifndef LOCATION_H_
#define LOCATION_H_

#include <iostream>
#include <stdio.h>
#include <cstdlib>
#include <cmath>
#include <queue>
#include <vector>

/*
struct for representing locations in the grid.
*/
struct Location;

typedef std::deque<Location*> t_location_deque;
typedef std::vector<Location*> t_location_vector;

struct Location
{
  bool isVisible, isWater, isHill, isFood, isDead;
  int ant, hillPlayer;

  int row, col;
	double dist;
	double dist_food;
  double dist_hill;
  double dist_enemy;
  double dist_ant;

  long long cost;
  long long weight;
	long long pheromone;

	Location *prev;

	t_location_vector around;

  inline Location()
    : row(0)
    , col(0)
    , isWater(0)
    , cost(1)
    , weight(10)
		, pheromone(1)
		, prev(0)
		, around(4)
  {
    reset();
  }

  inline Location(int r, int c)
    : row(r)
    , col(c)
    , isWater(0)
    , cost(1)
    , weight(10)
		, pheromone(1)
		, prev(0)
		, around(4)
  {
    reset();
  }

  inline Location(const Location& l)
    : isVisible(l.isVisible)
    , isWater(l.isWater)
    , isHill(l.isHill)
    , isFood(l.isFood)
    , isDead(l.isDead)
    , ant(l.ant)
    , hillPlayer(l.hillPlayer)
    , row(l.row)
    , col(l.col)
    , dist_food(l.dist_food)
    , dist_hill(l.dist_hill)
    , cost(l.cost)
    , weight(l.weight)
		, pheromone(l.pheromone)
		, prev(l.prev)
		, around(l.around)
  {
  }

  inline void reset()
  {
    isVisible = isHill = isFood = isDead = 0;
    ant = hillPlayer = -1;
		cost = 1;
    weight = isWater ? 999 : 10;
		prev = 0;
  }

  inline Location& operator=( const Location &l )
  {
    isVisible = l.isVisible;
    isWater = l.isWater;
    isHill = l.isHill;
    isFood = l.isFood;
    isDead = l.isDead;
    ant = l.ant;
    hillPlayer = l.hillPlayer;
    row = l.row;
    col = l.col;
    dist_food = l.dist_food;
    dist_hill = l.dist_hill;
    row = l.row;
    col = l.col;
    isWater = l.isWater;
    cost = l.cost;
    weight = l.weight;
		pheromone = l.pheromone;
		prev = l.prev;
		around = l.around;
    return *this;
  }

  inline long long weightcosts() const
  { return cost+weight+pheromone; }

	inline bool operator==( const Location &l ) const
	{ return (row == l.row && col == l.col); }

	inline bool operator>( const Location & rhs ) const
	{ return weightcosts() > rhs.weightcosts(); }
	inline bool operator<( const Location & rhs ) const
	{ return weightcosts() < rhs.weightcosts(); }
};

inline std::ostream& operator<<(std::ostream &os, const Location &l)
{
  os << '(' << l.row << ',' << l.col << ")";
  return os;
}

#endif //LOCATION_H_