Planet
navi homePPSaboutscreenshotsdownloaddevelopmentforum

source: code/branches/3DPacman_FS19/src/modules/pacman/PacmanGhost.h @ 12319

Last change on this file since 12319 was 12319, checked in by peterf, 5 years ago

PacmanPink implementation, but lots of SIGSEGV

  • Property svn:executable set to *
File size: 4.1 KB
Line 
1/*
2 *   ORXONOX - the hottest 3D action shooter ever to exist
3 *                    > www.orxonox.net <
4 *
5 *
6 *   License notice:
7 *
8 *   This program is free software; you can redistribute it and/or
9 *   modify it under the terms of the GNU General Public License
10 *   as published by the Free Software Foundation; either version 2
11 *   of the License, or (at your option) any later version.
12 *
13 *   This program is distributed in the hope that it will be useful,
14 *   but WITHOUT ANY WARRANTY; without even the implied warranty of
15 *   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
16 *   GNU General Public License for more details.
17 *
18 *   You should have received a copy of the GNU General Public License
19 *   along with this program; if not, write to the Free Software
20 *   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301, USA.
21 *
22 *   Author:
23 *      Marc Dreher
24 *   Co-authors:
25 *      ..
26 *
27 */
28
29#ifndef _PacmanGhost_H__
30#define _PacmanGhost_H__
31
32#include "OrxonoxPrereqs.h"
33
34#include "core/XMLPort.h"
35
36#include "worldentities/ControllableEntity.h"
37
38#include "Pacman.h"
39#include "GetShortestPathAlgorithm.h"
40
41namespace orxonox {
42
43    extern Vector3 possibleposition[67];
44
45    extern bool findpos(Vector3 one, Vector3 other);
46
47
48
49
50
51    class _OrxonoxExport PacmanGhost : public ControllableEntity
52    {
53        public:
54            PacmanGhost(Context* context);
55            virtual ~PacmanGhost();
56
57            virtual void XMLPort(Element& xmlelement, XMLPort::Mode mode) ; //!< Method for creating an AutonomousDrone through XML.
58            //virtual void tick(float dt); //!< Defines which actions the AutonomousDrone has to take in each tick.
59
60            virtual void move(float dt, Vector3 actuelposition, Vector3 velocity);
61           
62            virtual void resetGhost();
63
64            virtual void changewith(PacmanGhost* otherghost);
65            virtual void levelupvelo();
66
67            //bool findpos(Vector3 one, Vector3 other);     
68            virtual void changemovability();
69            bool dontmove = false;
70
71       
72            int decision = 0; 
73            Vector3 resetposition = Vector3(0,10,15);
74            Vector3 velocity;
75            int speed = 20;
76
77            Vector3 actuelposition;
78            bool ismoving = false;
79            int target_x = 0; 
80            int target_z = 0;
81            bool lockmove = false;
82
83        /*Vector3 getShortestPath(Vector3 start, Vector3 goal);
84
85        Vector3 setPureArrayPos(Vector3 &posToSet);
86
87        */Vector3 getPlayerPos();
88
89        Vector3 playerPos;
90
91        Vector3 lastPlayerPassedPoint;
92
93        Vector3 pointInFrontOfPlayer;
94        /*
95
96
97        //Vector3 pathAlgorithm;
98
99    public: //HACK
100
101    */
102
103    /*struct graphVertex;
104    void findNeighboorVertices(Vector3 actuelposition, graphVertex* adjacentVertices[], graphVertex listOfVerticesP2[]);
105    void updateShortestDistanceToStart(graphVertex &vertex, graphVertex &neighboor);
106    void findNearestNonVisitedNeighboor (graphVertex &vertex);
107    int graphDistance(Vector3 start, Vector3 goal);
108
109    graphVertex* findNextVertexToConsider(graphVertex listOfVerticesP[]);
110    Vector3 getShortestPath(Vector3 start, Vector3 goal);*/
111
112    struct graphVertex;
113    void findNeighboorVertices(Vector3 actuelposition, graphVertex* adjacentVertices[], graphVertex listOfVerticesP2[]);
114    void updateShortestDistanceToStart(graphVertex &vertex, graphVertex &neighboor);
115    void findNearestNonVisitedNeighboor (graphVertex &vertex, Vector3 pointToAvoidP3=Vector3(0,0,0));
116    int graphDistance(Vector3 start, Vector3 goal);
117
118    graphVertex* findNextVertexToConsider(graphVertex listOfVerticesP[], Vector3 pointToAvoidP2=Vector3(0,0,0));
119    Vector3 getShortestPath(Vector3 start, Vector3 goal, Vector3 pointToAvoidP1=Vector3(0,0,0));
120
121
122
123    //functions taken from PacmanPink
124
125
126    Vector3 getPointInFrontOfPacman(Vector3 pacLasVisPos,int indexForSWNE);
127    int findPlayerTravDir (Vector3 playerPosBefore, Vector3 playerPos);
128    Vector3 diffVector (Vector3 start, Vector3 goal);
129
130    bool playerFindPos(Vector3 one, Vector3 other);
131
132    bool jeanfindpos(Vector3 one, Vector3 other);
133
134    void setNewTargetGhost(Vector3 goalToGo);
135
136
137    };
138
139}
140
141#endif
Note: See TracBrowser for help on using the repository browser.