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
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
|
#include "simon.h"
#include <klocale.h>
#include <kdebug.h>
#include "deck.h"
#include <assert.h>
#include "cardmaps.h"
Simon::Simon( TDEMainWindow* parent, const char *name )
: Dealer( parent, name )
{
deck = Deck::new_deck(this);
deck->move(10, 10);
deck->hide();
const int dist_x = cardMap::CARDX() * 11 / 10 + 1;
for (int i=0; i<4; i++) {
target[i] = new Pile(i+1, this);
target[i]->move(10+(i+3)*dist_x, 10);
target[i]->setRemoveFlags(Pile::disallow);
target[i]->setAddFlags(Pile::several);
target[i]->setCheckIndex(0);
target[i]->setTarget(true);
}
for (int i=0; i<10; i++) {
store[i] = new Pile(5+i, this);
store[i]->move(15+dist_x*i, 10 + cardMap::CARDY() * 73 / 50);
store[i]->setAddFlags(Pile::addSpread | Pile::several);
store[i]->setRemoveFlags(Pile::several);
store[i]->setCheckIndex(1);
}
setActions(Dealer::Hint | Dealer::Demo);
}
void Simon::restart() {
deck->collectAndShuffle();
deal();
}
void Simon::deal() {
int piles = 3;
for (int round = 0; round < 8; round++)
{
for (int j = 0; j < piles; j++)
{
store[j]->add(deck->nextCard(), false, true);
}
piles++;
}
assert(deck->isEmpty());
}
bool Simon::checkPrefering( int checkIndex, const Pile *c1, const CardList& c2) const
{
if (checkIndex == 1) {
if (c1->isEmpty())
return false;
return (c1->top()->suit() == c2.first()->suit());
} else return false; // it's just important to keep this unique
}
bool Simon::checkAdd( int checkIndex, const Pile *c1, const CardList& c2) const
{
if (checkIndex == 1) {
if (c1->isEmpty())
return true;
return (c1->top()->rank() == c2.first()->rank() + 1);
} else {
if (!c1->isEmpty())
return false;
return (c2.first()->rank() == Card::King && c2.last()->rank() == Card::Ace);
}
}
bool Simon::checkRemove(int checkIndex, const Pile *p, const Card *c) const
{
if (checkIndex != 1)
return false;
// ok if just one card
if (c == p->top())
return true;
// Now we're trying to move two or more cards.
// First, let's check if the column is in valid
// (that is, in sequence, alternated colors).
int index = p->indexOf(c) + 1;
const Card *before = c;
while (true)
{
c = p->at(index++);
if (!((c->rank() == (before->rank()-1))
&& (c->suit() == before->suit())))
{
return false;
}
if (c == p->top())
return true;
before = c;
}
return true;
}
bool Simon::isGameLost() const
{
kdDebug(11111) <<"isGameLost" << endl;
for (int i=0; i<10; i++) {
if(store[i]->isEmpty())
return false;
kdDebug(11111) <<"store["<<i<<"]" << endl;
Card *c;
Card *top=store[i]->top();
int indexi=store[i]->indexOf(top);
while(--indexi >=0){
kdDebug(11111) <<top->name() << endl;
c=store[i]->at(indexi);
if(c->suit() == top->suit() &&
(top->rank()+1) == c->rank())
top=c;
else
break;
}
kdDebug(11111) <<"selected: " << top->name() << endl;
for(int j=1; j <10; j++){
int k=(i+j) % 10;
if(store[k]->isEmpty())
return false;
kdDebug(11111) <<"vs "<<store[k]->top()->name() << endl;
if((top->rank() +1) == store[k]->top()->rank())
return false;
}
}
return true;
}
static class LocalDealerInfo9 : public DealerInfo
{
public:
LocalDealerInfo9() : DealerInfo(I18N_NOOP("&Simple Simon"), 9) {}
virtual Dealer *createGame(TDEMainWindow *parent) { return new Simon(parent); }
} gfi9;
#include "simon.moc"
|
