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
|
// Brain Party
// Copyright (C) 2010 Paul Hudson (http://www.tuxradar.com/brainparty)
// Brain Party is free software; you can redistribute it and/or
// modify it under the terms of the GNU General Public License
// as published by the Free Software Foundation; either version 3
// of the License, or (at your option) any later version.
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
// You should have received a copy of the GNU General Public License
// along with this program; if not, write to the Free Software
// Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
#ifndef __PERFECTPATHS_H__
#define __PERFECTPATHS_H__
#include "Minigame.h"
class BPMiniGame_PerfectPaths_Square {
public:
int X;
int Y;
int XPos; // XPos and YPos are pixel co-ordinates to save calculations when drawing
int YPos;
Colour* Col;
int Difficulty;
const char* DifficultyStr;
int MoveCalc; // used for flood fill best move calculation; set high so that any path is better
int Pos; // the position of the square in the Squares list; saves looking it up when doing flood fills
BPMiniGame_PerfectPaths_Square() {
X = Y = XPos = YPos = Difficulty = Pos = 0;
MoveCalc = 9999;
DifficultyStr = NULL;
}
~BPMiniGame_PerfectPaths_Square() {
}
};
class BPMiniGame_PerfectPaths : public BPMiniGame {
public:
BPMiniGame_PerfectPaths(BPGame* game);
~BPMiniGame_PerfectPaths();
void Start();
int GetWeight();
void Render();
void Tick();
void OnMouseUp();
void OnMouseMove();
void OnMouseDown();
void CalculateOurScore();
void CheckResult();
void LevelUp();
void CalculateBestMove();
void FloodFill(BPMiniGame_PerfectPaths_Square* square);
bool CanMove(BPMiniGame_PerfectPaths_Square* square1, BPMiniGame_PerfectPaths_Square* square2);
void SetScore();
void RenderPerfect();
void RenderOK();
protected:
Texture* sfcBackground;
Texture* sfcPerfect;
Texture* sfcOK;
BPList<int> StartPositions;
BPList<int> EndPositions;
BPPList<Texture*> LoNumbers;
BPPList<Texture*> HiNumbers;
BPMiniGame_PerfectPaths_Square* StartPos;
BPMiniGame_PerfectPaths_Square* EndPos;
BPPList<BPMiniGame_PerfectPaths_Square*> Squares;
BPList<BPMiniGame_PerfectPaths_Square*> Moves;
BPList<BPMiniGame_PerfectPaths_Square*> MoveSquares; // used for flood fill best move calculation
int CurrentScore;
int BestScore;
SpriteFont* sfcScore;
int LastDiff;
int TotalDiff;
int TimeStarted;
int CurrentLevel;
MiniGameStates GameState;
int LastStateChange;
};
#endif
|
