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
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
|
/*
* Copyright (C) 2000-2009 Stephan Kulow <coolo@kde.org>
* Copyright (C) 2010 Parker Coates <coates@kde.org>
*
* License of original code:
* -------------------------------------------------------------------------
* Permission to use, copy, modify, and distribute this software and its
* documentation for any purpose and without fee is hereby granted,
* provided that the above copyright notice appear in all copies and that
* both that copyright notice and this permission notice appear in
* supporting documentation.
*
* This file is provided AS IS with no warranties of any kind. The author
* shall have no liability with respect to the infringement of copyrights,
* trade secrets or any patents by this file or any part thereof. In no
* event will the author be liable for any lost revenue or profits or
* other special, indirect and consequential damages.
* -------------------------------------------------------------------------
*
* License of modifications/additions made after 2009-01-01:
* -------------------------------------------------------------------------
* 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 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, see <http://www.gnu.org/licenses/>.
* -------------------------------------------------------------------------
*/
#include "simon.h"
#include "dealerinfo.h"
#include "pileutils.h"
#include "patsolve/simonsolver.h"
#include "settings.h"
#include <KLocalizedString>
Simon::Simon( const DealerInfo * di )
: DealerScene( di )
{
}
void Simon::initialize()
{
setDeckContents();
const qreal dist_x = 1.11;
for ( int i = 0; i < 4; ++i )
{
target[i] = new PatPile( this, i + 1, QStringLiteral( "target%1" ).arg( i ) );
target[i]->setPileRole(PatPile::Foundation);
target[i]->setLayoutPos((i+3)*dist_x, 0);
target[i]->setSpread(0, 0);
target[i]->setKeyboardSelectHint( KCardPile::NeverFocus );
target[i]->setKeyboardDropHint( KCardPile::AutoFocusTop );
}
for ( int i = 0; i < 10; ++i )
{
store[i] = new PatPile( this, 5 + i, QStringLiteral( "store%1" ).arg( i ) );
store[i]->setPileRole(PatPile::Tableau);
store[i]->setLayoutPos(dist_x*i, 1.2);
store[i]->setBottomPadding( 2.5 );
store[i]->setHeightPolicy( KCardPile::GrowDown );
store[i]->setZValue( 0.01 * i );
store[i]->setKeyboardSelectHint( KCardPile::AutoFocusDeepestRemovable );
store[i]->setKeyboardDropHint( KCardPile::AutoFocusTop );
}
setActions(DealerScene::Hint | DealerScene::Demo);
auto solver = new SimonSolver( this );
solver->default_max_positions = Settings::simpleSimonSolverIterationsLimit();
setSolver( solver );
//setNeededFutureMoves( 1 ); // could be some nonsense moves
}
void Simon::restart( const QList<KCard*> & cards )
{
QList<KCard*> cardList = cards;
QPointF initPos( 0, -deck()->cardHeight() );
for ( int piles = 9; piles >= 3; --piles )
for ( int j = 0; j < piles; ++j )
addCardForDeal( store[j], cardList.takeLast(), true, initPos );
for ( int j = 0; j < 10; ++j )
addCardForDeal( store[j], cardList.takeLast(), true, initPos );
Q_ASSERT( cardList.isEmpty() );
startDealAnimation();
}
bool Simon::checkPrefering(const PatPile * pile, const QList<KCard*> & oldCards, const QList<KCard*> & newCards) const
{
return pile->pileRole() == PatPile::Tableau
&& !oldCards.isEmpty()
&& oldCards.last()->suit() == newCards.first()->suit();
}
bool Simon::checkAdd(const PatPile * pile, const QList<KCard*> & oldCards, const QList<KCard*> & newCards) const
{
if (pile->pileRole() == PatPile::Tableau)
{
if (! (oldCards.isEmpty()
|| oldCards.last()->rank() == newCards.first()->rank() + 1 ))
{
return false;
}
int seqs_count = countSameSuitDescendingSequences(newCards);
if (seqs_count < 0)
return false;
// This is similar to the supermoves of Freecell - we can use empty
// columns to temporarily hold intermediate sub-sequences which are
// not the same suit - only a "false" parent.
// Shlomi Fish
int empty_piles_count = 0;
for (int i = 0; i < 10; ++i )
if (store[i]->isEmpty() && ( store[i]->index() != pile->index() ))
empty_piles_count++;
return (seqs_count <= (1 << empty_piles_count));
}
else
{
return oldCards.isEmpty()
&& newCards.first()->rank() == KCardDeck::King
&& newCards.last()->rank() == KCardDeck::Ace
&& isSameSuitDescending(newCards);
}
}
bool Simon::checkRemove(const PatPile * pile, const QList<KCard*> & cards) const
{
if (pile->pileRole() != PatPile::Tableau)
return false;
int seqs_count = countSameSuitDescendingSequences(cards);
return (seqs_count >= 0);
}
QString Simon::solverFormat() const
{
QString output;
QString tmp;
for (int i = 0; i < 4 ; i++) {
if (target[i]->isEmpty())
continue;
tmp += suitToString(target[i]->topCard()->suit()) + QLatin1String("-K ");
}
if (!tmp.isEmpty())
output += QStringLiteral("Foundations: %1\n").arg(tmp);
for (int i = 0; i < 10 ; i++)
{
cardsListToLine(output, store[i]->cards());
}
return output;
}
static class SimonDealerInfo : public DealerInfo
{
public:
SimonDealerInfo()
: DealerInfo(I18N_NOOP("Simple Simon"), SimpleSimonId)
{}
DealerScene *createGame() const override
{
return new Simon( this );
}
} simonDealerInfo;
|
