Changeset 12316 for code/branches/3DPacman_FS19/src/modules/pacman/PacmanGhost.h

Timestamp:

Apr 20, 2019, 5:22:51 PM (6 years ago)

Author:

peterf

Message:

Red Pacman seems to work partially

File:

• code/branches/3DPacman_FS19/src/modules/pacman/PacmanGhost.h (modified) (3 diffs)

code/branches/3DPacman_FS19/src/modules/pacman/PacmanGhost.h

@@ -36 +36 @@
 #include "worldentities/ControllableEntity.h"
 
+#include "Pacman.h"
+#include "GetShortestPathAlgorithm.h"
+
 namespace orxonox {
 
@@ -43 +46 @@
 
 
-    struct graphVertex;
-    void findNeighboorVertices(Vector3 actuelposition, graphVertex adjacentVertices[]);
-    void updateShortestDistanceToStart(graphVertex &vertex, graphVertex &neighboor);
-    graphVertex findNextVertexToConsider(graphVertex[]);
 
-    extern graphVertex listOfVertices[];
 
 
@@ -83 +81 @@
             bool lockmove = false;
 
-        Vector3 getShortestPath(Vector3 start, Vector3 goal);
+        /*Vector3 getShortestPath(Vector3 start, Vector3 goal);
 
         Vector3 setPureArrayPos(Vector3 &posToSet);
 
-            private:
+        */Vector3 getPlayerPos();
+
+        Vector3 playerPos;
+
+        Vector3 lastPlayerPassedPoint;/*
+
+        //Vector3 pathAlgorithm;
+
+    public: //HACK
+
+    struct graphVertex;
+    void findNeighboorVertices(Vector3 actuelposition, graphVertex* adjacentVertices[]);
+    void updateShortestDistanceToStart(graphVertex &vertex, graphVertex &neighboor);
+    void findNearestNonVisitedNeighboor (graphVertex &vertex);
+    int graphDistance(Vector3 start, Vector3 goal);
+
+    graphVertex* findNextVertexToConsider(graphVertex listOfVerticesP[]);*/
+
+    struct graphVertex;
+    void findNeighboorVertices(Vector3 actuelposition, graphVertex* adjacentVertices[], graphVertex listOfVerticesP2[]);
+    void updateShortestDistanceToStart(graphVertex &vertex, graphVertex &neighboor);
+    void findNearestNonVisitedNeighboor (graphVertex &vertex);
+    int graphDistance(Vector3 start, Vector3 goal);
+
+    graphVertex* findNextVertexToConsider(graphVertex listOfVerticesP[]);
+    Vector3 getShortestPath(Vector3 start, Vector3 goal);
+
+
     };