aboutsummaryrefslogtreecommitdiff
path: root/game/ground.cpp
diff options
context:
space:
mode:
authorjacopograndi <jak.sk8@hotmail.it>2021-08-19 18:46:51 +0200
committerjacopograndi <jak.sk8@hotmail.it>2021-08-19 18:46:51 +0200
commita8bcacc95045102e67f2feabbdddf79535837554 (patch)
tree5781dd4cb2fe66b67deab84ff4641b7e21b9c174 /game/ground.cpp
forgot to make repo until now
Diffstat (limited to 'game/ground.cpp')
-rw-r--r--game/ground.cpp82
1 files changed, 82 insertions, 0 deletions
diff --git a/game/ground.cpp b/game/ground.cpp
new file mode 100644
index 0000000..c0ba2ca
--- /dev/null
+++ b/game/ground.cpp
@@ -0,0 +1,82 @@
+#include "ground.h"
+#include "gst.h"
+
+#include <iostream>
+#include <algorithm>
+
+Ground::Ground (int sx, int sy) {
+ sizex = sx; sizey = sy;
+ tiles = new int[sx*sy];
+ for (int i=0; i<sx*sy; i++) tiles[i] = 0;
+}
+
+Ground::~Ground () {
+
+}
+
+int Ground::at(int x, int y) {
+ return x+y*sizex;
+}
+
+
+// move area
+std::vector<int> Ground::star (int pos) {
+ std::vector<int> fs;
+ int x = pos % sizex, y = pos / sizex;
+ if (x-1 >= 0) { fs.push_back(at(x-1, y)); }
+ if (x+1 < sizex) { fs.push_back(at(x+1, y)); }
+ if (y-1 >= 0) { fs.push_back(at(x, y-1)); }
+ if (y+1 < sizey) { fs.push_back(at(x, y+1)); }
+ return fs;
+}
+
+class step { public:
+ step(int pos, int m) : pos(pos), m(m) {};
+ bool operator==(step oth) { return pos==oth.pos && m==oth.m; }
+ bool operator==(int p) { return pos==p; }
+ int pos, m;
+};
+
+std::vector<int> Ground::move_area (Gst &gst, Entity ent) {
+ std::vector<int> moves;
+ std::vector<int> visited { at(ent.x, ent.y) };
+ std::vector<step> frontier { step { at(ent.x, ent.y), ent.info.move } };
+
+ int iter=0;
+ for (; iter<10000; iter++) {
+
+ if (frontier.size() == 0) break;
+ step maxf {-1, -1};
+ for (step t : frontier) {
+ if (t.m > maxf.m) {
+ maxf.pos = t.pos;
+ maxf.m = t.m;
+ }
+ }
+ frontier.erase(std::remove(frontier.begin(), frontier.end(), maxf),
+ frontier.end());
+ auto forward_star = star(maxf.pos);
+ for (int t : forward_star) {
+ if (!(std::find(visited.begin(), visited.end(), t) != visited.end())
+ && !(std::find(frontier.begin(), frontier.end(), t) != frontier.end())) {
+ int walkedm = maxf.m - gst.tiles[gst.ground.tiles[t]].move_cost;
+ bool obstructed = false;
+ for (Entity &e : gst.entities) {
+ if (e.owner != ent.owner && at(e.x, e.y) == t) {
+ obstructed = true;
+ break;
+ }
+ }
+ if (walkedm >= 0 && !obstructed) {
+ frontier.emplace_back(t, walkedm);
+ moves.push_back(t);
+ }
+ }
+ }
+ visited.push_back(maxf.pos);
+ }
+
+ std::cout << "iters: " << iter;
+
+ return moves;
+} \ No newline at end of file