mirror of
https://github.com/shlomif/PySolFC.git
synced 2025-04-05 00:02:29 -04:00
5175caf86a
+ added statistics progression; statistics progression dialog + new animation speed: `medium'; renamed `timer based' to `fast' + added flip animation (animatedFlip) + added move to waste animation (animatedFlipAndMove) + added cancel-drag animation (moveCardsBackHandler) * improved demo game (snapshots based check for loop) - removed setting text color from file name - removed auto generation shadows (too slow) * optimized menu creation * changed some keybindings * updated russian translation * many bugfixes git-svn-id: file:///home/shlomif/Backup/svn-dumps/PySolFC/svnsync-repos/pysolfc/PySolFC/trunk@138 efabe8c0-fbe8-4139-b769-b5e6d273206e
368 lines
13 KiB
Python
368 lines
13 KiB
Python
## vim:ts=4:et:nowrap
|
|
##
|
|
##---------------------------------------------------------------------------##
|
|
##
|
|
## PySol -- a Python Solitaire game
|
|
##
|
|
## Copyright (C) 2000 Markus Franz Xaver Johannes Oberhumer
|
|
## Copyright (C) 1999 Markus Franz Xaver Johannes Oberhumer
|
|
## Copyright (C) 1998 Markus Franz Xaver Johannes Oberhumer
|
|
##
|
|
## 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; see the file COPYING.
|
|
## If not, write to the Free Software Foundation, Inc.,
|
|
## 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
|
|
##
|
|
## Markus F.X.J. Oberhumer
|
|
## <markus@oberhumer.com>
|
|
## http://www.oberhumer.com/pysol
|
|
##
|
|
##---------------------------------------------------------------------------##
|
|
|
|
__all__ = []
|
|
|
|
# imports
|
|
import sys
|
|
|
|
# PySol imports
|
|
from pysollib.gamedb import registerGame, GameInfo, GI
|
|
from pysollib.util import *
|
|
from pysollib.mfxutil import kwdefault
|
|
from pysollib.stack import *
|
|
from pysollib.game import Game
|
|
from pysollib.layout import Layout
|
|
from pysollib.hint import AbstractHint, DefaultHint, CautiousDefaultHint
|
|
from pysollib.hint import FreeCellSolverWrapper
|
|
|
|
|
|
# /***********************************************************************
|
|
# // Castles in Spain
|
|
# ************************************************************************/
|
|
|
|
class CastlesInSpain(Game):
|
|
Layout_Method = Layout.bakersDozenLayout
|
|
Talon_Class = InitialDealTalonStack
|
|
Foundation_Class = SS_FoundationStack
|
|
RowStack_Class = SuperMoveAC_RowStack
|
|
Hint_Class = CautiousDefaultHint
|
|
Solver_Class = FreeCellSolverWrapper()
|
|
|
|
#
|
|
# game layout
|
|
#
|
|
|
|
def createGame(self, **layout):
|
|
# create layout
|
|
l, s = Layout(self), self.s
|
|
kwdefault(layout, rows=13, playcards=9)
|
|
self.Layout_Method(l, **layout)
|
|
self.setSize(l.size[0], l.size[1])
|
|
# create stacks
|
|
s.talon = self.Talon_Class(l.s.talon.x, l.s.talon.y, self)
|
|
for r in l.s.foundations:
|
|
s.foundations.append(self.Foundation_Class(r.x, r.y, self, suit=r.suit))
|
|
for r in l.s.rows:
|
|
s.rows.append(self.RowStack_Class(r.x, r.y, self))
|
|
# default
|
|
l.defaultAll()
|
|
|
|
def startGame(self, flip=(0, 0, 0)):
|
|
for f in flip:
|
|
self.s.talon.dealRow(flip=f, frames=0)
|
|
self.startDealSample()
|
|
self.s.talon.dealRow()
|
|
|
|
shallHighlightMatch = Game._shallHighlightMatch_AC
|
|
|
|
|
|
# /***********************************************************************
|
|
# // Martha
|
|
# ************************************************************************/
|
|
|
|
class Martha_RowStack(AC_RowStack):
|
|
def acceptsCards(self, from_stack, cards):
|
|
if not AC_RowStack.acceptsCards(self, from_stack, cards):
|
|
return 0
|
|
# when empty, only accept a single card
|
|
return self.cards or len(cards) == 1
|
|
|
|
|
|
class Martha(CastlesInSpain):
|
|
Solver_Class = None
|
|
RowStack_Class = Martha_RowStack
|
|
|
|
def createGame(self):
|
|
CastlesInSpain.createGame(self, rows=12, playcards=13)
|
|
|
|
def _shuffleHook(self, cards):
|
|
# move Aces to bottom of the Talon (i.e. last cards to be dealt)
|
|
return self._shuffleHookMoveToBottom(cards, lambda c: (c.rank == 0, c.suit))
|
|
|
|
def startGame(self):
|
|
CastlesInSpain.startGame(self, flip=(0, 1, 0))
|
|
self.s.talon.dealRow(rows=self.s.foundations)
|
|
|
|
|
|
# /***********************************************************************
|
|
# // Baker's Dozen
|
|
# ************************************************************************/
|
|
|
|
class BakersDozen(CastlesInSpain):
|
|
RowStack_Class = StackWrapper(RK_RowStack, max_move=1, max_accept=1,
|
|
base_rank=NO_RANK)
|
|
Solver_Class = FreeCellSolverWrapper(preset='bakers_dozen')
|
|
|
|
def _shuffleHook(self, cards):
|
|
# move Kings to bottom of each stack
|
|
i, n = 0, len(self.s.rows)
|
|
kings = []
|
|
for c in cards:
|
|
if c.rank == KING:
|
|
kings.append(i)
|
|
i = i + 1
|
|
for i in kings:
|
|
j = i % n
|
|
while j < i:
|
|
if cards[j].rank != KING:
|
|
cards[i], cards[j] = cards[j], cards[i]
|
|
break
|
|
j = j + n
|
|
cards.reverse()
|
|
return cards
|
|
|
|
def startGame(self):
|
|
CastlesInSpain.startGame(self, flip=(1, 1, 1))
|
|
|
|
shallHighlightMatch = Game._shallHighlightMatch_RK
|
|
|
|
|
|
# /***********************************************************************
|
|
# // Spanish Patience
|
|
# // Portuguese Solitaire
|
|
# ************************************************************************/
|
|
|
|
class SpanishPatience(BakersDozen):
|
|
Foundation_Class = AC_FoundationStack
|
|
Solver_Class = None
|
|
|
|
|
|
class PortugueseSolitaire(BakersDozen):
|
|
RowStack_Class = StackWrapper(RK_RowStack, base_rank=KING)
|
|
Solver_Class = FreeCellSolverWrapper(sbb='rank', esf='kings')
|
|
def _shuffleHook(self, cards):
|
|
return cards
|
|
|
|
|
|
class SpanishPatienceII(PortugueseSolitaire):
|
|
RowStack_Class = RK_RowStack
|
|
Solver_Class = FreeCellSolverWrapper(sbb='rank', sm='unlimited')
|
|
|
|
|
|
# /***********************************************************************
|
|
# // Good Measure
|
|
# ************************************************************************/
|
|
|
|
class GoodMeasure(BakersDozen):
|
|
Solver_Class = FreeCellSolverWrapper(preset='good_measure')
|
|
|
|
def createGame(self):
|
|
CastlesInSpain.createGame(self, rows=10)
|
|
|
|
def _shuffleHook(self, cards):
|
|
cards = BakersDozen._shuffleHook(self, cards)
|
|
# move 2 Aces to bottom of the Talon (i.e. last cards to be dealt)
|
|
return self._shuffleHookMoveToBottom(cards, lambda c: (c.rank == 0, c.suit), 2)
|
|
|
|
def startGame(self):
|
|
CastlesInSpain.startGame(self, flip=(1, 1, 1, 1))
|
|
for i in range(2):
|
|
c = self.s.talon.cards[-1]
|
|
assert c.rank == ACE
|
|
self.flipMove(self.s.talon)
|
|
self.moveMove(1, self.s.talon, self.s.foundations[c.suit])
|
|
|
|
|
|
# /***********************************************************************
|
|
# // Cruel
|
|
# ************************************************************************/
|
|
|
|
class Cruel_Talon(TalonStack):
|
|
def canDealCards(self):
|
|
## FIXME: this is to avoid loops in the demo
|
|
#if self.game.demo and self.game.moves.index >= 100:
|
|
# return False
|
|
if self.round == self.max_rounds:
|
|
return False
|
|
return not self.game.isGameWon()
|
|
|
|
def dealCards(self, sound=0):
|
|
lr = len(self.game.s.rows)
|
|
# move all cards to the Talon and redeal (no shuffling)
|
|
num_cards = 0
|
|
assert len(self.cards) == 0
|
|
rows = list(self.game.s.rows)[:]
|
|
rows.reverse()
|
|
for r in rows:
|
|
for i in range(len(r.cards)):
|
|
num_cards = num_cards + 1
|
|
self.game.moveMove(1, r, self, frames=0)
|
|
assert len(self.cards) == num_cards
|
|
if num_cards == 0: # game already finished
|
|
return 0
|
|
# redeal in packs of 4 cards
|
|
self.game.nextRoundMove(self)
|
|
n, i = num_cards, 0
|
|
deal = [4] * lr
|
|
extra_cards = n - 4 * lr
|
|
while extra_cards > 0:
|
|
# note: this can only happen in Tarock games like Nasty
|
|
deal[i] = deal[i] + 1
|
|
i = (i + 1) % lr
|
|
extra_cards = extra_cards - 1
|
|
##print n, deal
|
|
self.game.startDealSample()
|
|
for i in range(lr):
|
|
k = min(deal[i], n)
|
|
frames = (0, 4)[n <= 3*4]
|
|
for j in range(k):
|
|
self.game.moveMove(1, self, self.game.s.rows[i], frames=frames)
|
|
n = n - k
|
|
if n == 0:
|
|
break
|
|
# done
|
|
self.game.stopSamples()
|
|
assert n == len(self.cards) == 0
|
|
return num_cards
|
|
|
|
|
|
class Cruel(CastlesInSpain):
|
|
Talon_Class = StackWrapper(Cruel_Talon, max_rounds=-1)
|
|
RowStack_Class = StackWrapper(SS_RowStack, base_rank=NO_RANK)
|
|
##Solver_Class = FreeCellSolverWrapper(preset='cruel')
|
|
Solver_Class = None
|
|
|
|
def createGame(self):
|
|
CastlesInSpain.createGame(self, rows=12)
|
|
|
|
def _shuffleHook(self, cards):
|
|
# move Aces to bottom of the Talon (i.e. last cards to be dealt)
|
|
return self._shuffleHookMoveToBottom(cards, lambda c: (c.rank == 0, c.suit))
|
|
|
|
def startGame(self):
|
|
CastlesInSpain.startGame(self, flip=(1, 1, 1))
|
|
self.s.talon.dealRow(rows=self.s.foundations)
|
|
|
|
shallHighlightMatch = Game._shallHighlightMatch_SS
|
|
|
|
|
|
# /***********************************************************************
|
|
# // Royal Family
|
|
# // Indefatigable
|
|
# ************************************************************************/
|
|
|
|
class RoyalFamily(Cruel):
|
|
Foundation_Class = StackWrapper(SS_FoundationStack, base_rank=KING, dir=-1)
|
|
Talon_Class = StackWrapper(Cruel_Talon, max_rounds=2)
|
|
RowStack_Class = UD_AC_RowStack
|
|
|
|
def _shuffleHook(self, cards):
|
|
# move Kings to bottom of the Talon (i.e. last cards to be dealt)
|
|
return self._shuffleHookMoveToBottom(cards, lambda c: (c.rank == KING, c.suit))
|
|
|
|
shallHighlightMatch = Game._shallHighlightMatch_AC
|
|
|
|
|
|
class Indefatigable(Cruel):
|
|
Foundation_Class = StackWrapper(SS_FoundationStack, max_move=0)
|
|
Talon_Class = StackWrapper(Cruel_Talon, max_rounds=3)
|
|
RowStack_Class = UD_SS_RowStack
|
|
|
|
def _shuffleHook(self, cards):
|
|
# move Aces to bottom of the Talon (i.e. last cards to be dealt)
|
|
return self._shuffleHookMoveToBottom(cards, lambda c: (c.rank == ACE, c.suit))
|
|
|
|
shallHighlightMatch = Game._shallHighlightMatch_SS
|
|
|
|
|
|
# /***********************************************************************
|
|
# // Perseverance
|
|
# ************************************************************************/
|
|
|
|
class Perseverance(Cruel, BakersDozen):
|
|
Talon_Class = StackWrapper(Cruel_Talon, max_rounds=3)
|
|
RowStack_Class = StackWrapper(SS_RowStack, base_rank=NO_RANK, dir=-1, max_move=UNLIMITED_MOVES, max_accept=UNLIMITED_ACCEPTS)
|
|
Solver_Class = None
|
|
|
|
def _shuffleHook(self, cards):
|
|
# move Kings to bottom of each stack (???)
|
|
#cards = BakersDozen._shuffleHook(self, cards)
|
|
# move Aces to bottom of the Talon (i.e. last cards to be dealt)
|
|
cards = Cruel._shuffleHook(self, cards)
|
|
return cards
|
|
|
|
## def dealCards(self, sound=1):
|
|
## Cruel.dealCards(self, sound)
|
|
|
|
|
|
# /***********************************************************************
|
|
# // Ripple Fan
|
|
# ************************************************************************/
|
|
|
|
class RippleFan(CastlesInSpain):
|
|
Solver_Class = None
|
|
|
|
def createGame(self):
|
|
# create layout
|
|
l, s = Layout(self), self.s
|
|
Layout.bakersDozenLayout(l, rows=13)
|
|
self.setSize(l.size[0], l.size[1])
|
|
# create stacks
|
|
s.talon = Cruel_Talon(l.s.talon.x, l.s.talon.y, self, max_rounds=-1)
|
|
for r in l.s.foundations:
|
|
s.foundations.append(SS_FoundationStack(r.x, r.y, self, suit=r.suit))
|
|
for r in l.s.rows:
|
|
s.rows.append(SS_RowStack(r.x, r.y, self, base_rank=NO_RANK))
|
|
# default
|
|
l.defaultAll()
|
|
|
|
def startGame(self):
|
|
CastlesInSpain.startGame(self, flip=(1, 1, 1))
|
|
|
|
shallHighlightMatch = Game._shallHighlightMatch_SS
|
|
|
|
|
|
# register the game
|
|
registerGame(GameInfo(83, CastlesInSpain, "Castles in Spain",
|
|
GI.GT_BAKERS_DOZEN, 1, 0, GI.SL_BALANCED))
|
|
registerGame(GameInfo(84, Martha, "Martha",
|
|
GI.GT_BAKERS_DOZEN, 1, 0, GI.SL_BALANCED))
|
|
registerGame(GameInfo(31, BakersDozen, "Baker's Dozen",
|
|
GI.GT_BAKERS_DOZEN | GI.GT_OPEN, 1, 0, GI.SL_MOSTLY_SKILL))
|
|
registerGame(GameInfo(85, SpanishPatience, "Spanish Patience",
|
|
GI.GT_BAKERS_DOZEN | GI.GT_OPEN, 1, 0, GI.SL_MOSTLY_SKILL))
|
|
registerGame(GameInfo(86, GoodMeasure, "Good Measure",
|
|
GI.GT_BAKERS_DOZEN | GI.GT_OPEN, 1, 0, GI.SL_MOSTLY_SKILL))
|
|
registerGame(GameInfo(104, Cruel, "Cruel",
|
|
GI.GT_BAKERS_DOZEN | GI.GT_OPEN, 1, -1, GI.SL_BALANCED))
|
|
registerGame(GameInfo(291, RoyalFamily, "Royal Family",
|
|
GI.GT_BAKERS_DOZEN | GI.GT_OPEN, 1, 1, GI.SL_MOSTLY_SKILL))
|
|
registerGame(GameInfo(308, PortugueseSolitaire, "Portuguese Solitaire",
|
|
GI.GT_BAKERS_DOZEN | GI.GT_OPEN, 1, 0, GI.SL_MOSTLY_SKILL))
|
|
registerGame(GameInfo(404, Perseverance, "Perseverance",
|
|
GI.GT_BAKERS_DOZEN | GI.GT_OPEN, 1, 2, GI.SL_BALANCED))
|
|
registerGame(GameInfo(369, RippleFan, "Ripple Fan",
|
|
GI.GT_BAKERS_DOZEN, 1, -1, GI.SL_MOSTLY_SKILL))
|
|
registerGame(GameInfo(515, Indefatigable, "Indefatigable",
|
|
GI.GT_BAKERS_DOZEN | GI.GT_OPEN, 1, 2, GI.SL_MOSTLY_SKILL))
|
|
registerGame(GameInfo(664, SpanishPatienceII, "Spanish Patience II",
|
|
GI.GT_BAKERS_DOZEN | GI.GT_OPEN, 1, 0, GI.SL_MOSTLY_SKILL))
|