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
137
138
139
140
141
|
/**
* Copyright Michel Filippi <[email protected]>
* Robert Williams
* Andrew Chant <[email protected]>
* André Luiz dos Santos <[email protected]>
* Benjamin Meyer <[email protected]>
*
* This file is part of the ksnake package
*
* This program 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 2 of the License, or
* (at your option) any later version.
*
* This library 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
* Library General Public License for more details.
*
* You should have received a copy of the GNU Library General Public License
* along with this library; see the file COPYING.LIB. If not, write to
* the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
* Boston, MA 02110-1301, USA.
*/
#ifndef SAMY_H
#define SAMY_H
#include <krandomsequence.h>
#include "pixServer.h"
#include "board.h"
class Snake : public TQObject
{
Q_OBJECT
TQ_OBJECT
signals:
void score(bool, int);
void killed();
void closeGate(int);
void restartTimer();
void goingOut();
public:
Snake(Board *b, PixServer *p, Gate g, PixMap x);
~Snake() {}
void tqrepaint( bool );
void zero();
protected:
Board *board;
PixServer *pixServer;
Gate gate;
PixMap pixmap;
struct Samy {
int direction;
SnakePix pixmap;
int index;
};
TQPtrList<Samy> list;
KRandomSequence random;
void reset(int index, int border);
void appendSamy();
void updateSamy();
int tail() const { return (list.count() -1 ); }
bool growing() const { return (grow > 0 ? TRUE : FALSE); }
int hold;
int grow;
};
class CompuSnake : public Snake
{
public:
CompuSnake(Board *b, PixServer *p);
virtual ~CompuSnake() {}
virtual void nextMove();
protected:
bool init();
void removeSamy();
bool findEmpty(int i, int it);
bool permission();
void out();
};
/**
* Don't eat any apples.
* Try to hit samy's head.
*/
class KillerCompuSnake : public CompuSnake
{
public:
KillerCompuSnake(Board *b, PixServer *p) : CompuSnake(b, p) {}
virtual ~KillerCompuSnake() {}
virtual void nextMove();
private:
int lastIndex;
};
/**
* Eat as much apples as it can, from down to up.
* When all apples are eaten, try to reach the gate.
*/
class EaterCompuSnake : public CompuSnake
{
public:
EaterCompuSnake(Board *b, PixServer *p) : CompuSnake(b, p) {}
virtual ~EaterCompuSnake() {}
virtual void nextMove();
private:
int lastIndex;
};
enum samyState { ok, ko, out };
class SamySnake : public Snake
{
public:
SamySnake(Board *, PixServer *);
samyState nextMove(int direction);
void init();
};
#endif // SAMY_H
|
