mirror of
https://github.com/shlomif/PySolFC.git
synced 2025-04-05 00:02:29 -04:00
758bdec2c4
+ new experimental options: `randomize_place' * added columnbreak to favorites menu git-svn-id: https://pysolfc.svn.sourceforge.net/svnroot/pysolfc/PySolFC/trunk@11 39dd0a4e-7c14-0410-91b3-c4f2d318f732
301 lines
10 KiB
Python
301 lines
10 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.stack import *
|
|
from pysollib.game import Game
|
|
from pysollib.layout import Layout
|
|
from pysollib.hint import AbstractHint, DefaultHint, CautiousDefaultHint
|
|
from pysollib.pysoltk import MfxCanvasText
|
|
|
|
|
|
# /***********************************************************************
|
|
# //
|
|
# ************************************************************************/
|
|
|
|
class Pyramid_Hint(DefaultHint):
|
|
# consider moving card to the Talon as well
|
|
def step010(self, dropstacks, rows):
|
|
rows = rows + (self.game.s.talon,)
|
|
return DefaultHint.step010(self, dropstacks, rows)
|
|
|
|
|
|
# /***********************************************************************
|
|
# // basic logic for Talon, Waste and Rows
|
|
# ************************************************************************/
|
|
|
|
class Pyramid_StackMethods:
|
|
def acceptsCards(self, from_stack, cards):
|
|
if self.basicIsBlocked():
|
|
return 0
|
|
if from_stack is self or not self.cards or len(cards) != 1:
|
|
return 0
|
|
c = self.cards[-1]
|
|
return c.face_up and cards[0].face_up and cards[0].rank + c.rank == 11
|
|
|
|
def _dropKingClickHandler(self, event):
|
|
if not self.cards:
|
|
return 0
|
|
c = self.cards[-1]
|
|
if c.face_up and c.rank == KING and not self.basicIsBlocked():
|
|
self.game.playSample("autodrop", priority=20)
|
|
self.playMoveMove(1, self.game.s.foundations[0], sound=0)
|
|
return 1
|
|
return 0
|
|
|
|
def _dropPairMove(self, n, other_stack, frames=-1, shadow=-1):
|
|
if not self.game.demo:
|
|
self.game.playSample("droppair", priority=200)
|
|
assert n == 1 and self.acceptsCards(other_stack, [other_stack.cards[-1]])
|
|
old_state = self.game.enterState(self.game.S_FILL)
|
|
f = self.game.s.foundations[0]
|
|
self.game.moveMove(n, self, f, frames=frames, shadow=shadow)
|
|
self.game.moveMove(n, other_stack, f, frames=frames, shadow=shadow)
|
|
self.game.leaveState(old_state)
|
|
self.fillStack()
|
|
other_stack.fillStack()
|
|
|
|
def moveMove(self, ncards, to_stack, frames=-1, shadow=-1):
|
|
if to_stack in self.game.s.foundations:
|
|
self.game.moveMove(ncards, self, to_stack, frames=frames, shadow=shadow)
|
|
self.fillStack()
|
|
else:
|
|
self._dropPairMove(ncards, to_stack, frames=-1, shadow=shadow)
|
|
|
|
|
|
# /***********************************************************************
|
|
# //
|
|
# ************************************************************************/
|
|
|
|
class Pyramid_Foundation(AbstractFoundationStack):
|
|
def acceptsCards(self, from_stack, cards):
|
|
if not AbstractFoundationStack.acceptsCards(self, from_stack, cards):
|
|
return 0
|
|
# We accept any King. Pairs will get delivered by _dropPairMove.
|
|
return cards[0].rank == KING
|
|
|
|
|
|
# note that this Talon can accept and drop cards
|
|
class Pyramid_Talon(Pyramid_StackMethods, FaceUpWasteTalonStack):
|
|
def clickHandler(self, event):
|
|
if self._dropKingClickHandler(event):
|
|
return 1
|
|
return FaceUpWasteTalonStack.clickHandler(self, event)
|
|
|
|
def canDealCards(self):
|
|
if not FaceUpWasteTalonStack.canDealCards(self):
|
|
return 0
|
|
return not self.game.isGameWon()
|
|
|
|
def canDropCards(self, stacks):
|
|
if self.cards:
|
|
cards = self.cards[-1:]
|
|
for s in stacks:
|
|
if s is not self and s.acceptsCards(self, cards):
|
|
return (s, 1)
|
|
return (None, 0)
|
|
|
|
|
|
class Pyramid_Waste(Pyramid_StackMethods, WasteStack):
|
|
def clickHandler(self, event):
|
|
if self._dropKingClickHandler(event):
|
|
return 1
|
|
return WasteStack.clickHandler(self, event)
|
|
|
|
|
|
class Pyramid_RowStack(Pyramid_StackMethods, OpenStack):
|
|
def __init__(self, x, y, game):
|
|
OpenStack.__init__(self, x, y, game, max_accept=1, max_cards=2)
|
|
self.CARD_YOFFSET = 1
|
|
|
|
STEP = (1, 2, 2, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6)
|
|
|
|
def basicIsBlocked(self):
|
|
r, step = self.game.s.rows, self.STEP
|
|
i, n = self.id, 1
|
|
while i < 21:
|
|
i = i + step[i]
|
|
n = n + 1
|
|
for j in range(i, i+n):
|
|
if r[j].cards:
|
|
return 1
|
|
return 0
|
|
|
|
def clickHandler(self, event):
|
|
if self._dropKingClickHandler(event):
|
|
return 1
|
|
return OpenStack.clickHandler(self, event)
|
|
|
|
|
|
# /***********************************************************************
|
|
# // Pyramid
|
|
# ************************************************************************/
|
|
|
|
class Pyramid(Game):
|
|
Hint_Class = Pyramid_Hint
|
|
|
|
#
|
|
# game layout
|
|
#
|
|
|
|
def createGame(self, rows=4):
|
|
# create layout
|
|
l, s = Layout(self), self.s
|
|
|
|
# set window
|
|
self.setSize(l.XM + 9*l.XS, l.YM + 4*l.YS)
|
|
|
|
# create stacks
|
|
for i in range(7):
|
|
x = l.XM + (8-i) * l.XS / 2
|
|
y = l.YM + i * l.YS / 2
|
|
for j in range(i+1):
|
|
s.rows.append(Pyramid_RowStack(x, y, self))
|
|
x = x + l.XS
|
|
|
|
x, y = l.XM, l.YM
|
|
s.talon = Pyramid_Talon(x, y, self, max_rounds=3, max_accept=1)
|
|
l.createText(s.talon, "se")
|
|
tx, ty, ta, tf = l.getTextAttr(s.talon, "ne")
|
|
s.talon.texts.rounds = MfxCanvasText(self.canvas, tx, ty,
|
|
anchor=ta,
|
|
font=self.app.getFont("canvas_default"))
|
|
y = y + l.YS
|
|
s.waste = Pyramid_Waste(x, y, self, max_accept=1)
|
|
l.createText(s.waste, "se")
|
|
x, y = self.width - l.XS, l.YM
|
|
s.foundations.append(Pyramid_Foundation(x, y, self,
|
|
suit=ANY_SUIT, dir=0, base_rank=ANY_RANK,
|
|
max_move=0, max_cards=52))
|
|
|
|
# define stack-groups
|
|
self.sg.talonstacks = [s.talon] + [s.waste]
|
|
self.sg.openstacks = s.rows + self.sg.talonstacks
|
|
self.sg.dropstacks = s.rows + self.sg.talonstacks
|
|
|
|
|
|
#
|
|
# game overrides
|
|
#
|
|
|
|
def startGame(self):
|
|
self.startDealSample()
|
|
self.s.talon.dealRow()
|
|
self.s.talon.dealCards() # deal first card to WasteStack
|
|
|
|
def getAutoStacks(self, event=None):
|
|
return (self.sg.dropstacks, self.sg.dropstacks, ())
|
|
|
|
def shallHighlightMatch(self, stack1, card1, stack2, card2):
|
|
return card1.rank + card2.rank == 11
|
|
|
|
|
|
# /***********************************************************************
|
|
# // Relaxed Pyramid
|
|
# ************************************************************************/
|
|
|
|
class RelaxedPyramid(Pyramid):
|
|
# the pyramid must be empty
|
|
def isGameWon(self):
|
|
return getNumberOfFreeStacks(self.s.rows) == len(self.s.rows)
|
|
|
|
|
|
# /***********************************************************************
|
|
# // Thirteen
|
|
# // FIXME: UNFINISHED
|
|
# // (this doesn't work yet as 2 cards of the Waste should be playable)
|
|
# ************************************************************************/
|
|
# Thirteen #89404422185320919548
|
|
|
|
class Thirteen(Pyramid):
|
|
|
|
#
|
|
# game layout
|
|
#
|
|
|
|
def createGame(self):
|
|
# create layout
|
|
l, s = Layout(self), self.s
|
|
|
|
# set window
|
|
self.setSize(7*l.XS+l.XM, 5*l.YS+l.YM)
|
|
|
|
# create stacks
|
|
for i in range(7):
|
|
x = l.XM + (6-i) * l.XS / 2
|
|
y = l.YM + l.YS + i * l.YS / 2
|
|
for j in range(i+1):
|
|
s.rows.append(Pyramid_RowStack(x, y, self))
|
|
x = x + l.XS
|
|
x, y = l.XM, l.YM
|
|
s.talon = WasteTalonStack(x, y, self, max_rounds=1)
|
|
l.createText(s.talon, "s")
|
|
x = x + l.XS
|
|
s.waste = Pyramid_Waste(x, y, self)
|
|
l.createText(s.waste, "s")
|
|
s.waste.CARD_XOFFSET = 14
|
|
x, y = self.width - l.XS, l.YM
|
|
s.foundations.append(Pyramid_Foundation(x, y, self,
|
|
suit=ANY_SUIT, dir=0, base_rank=ANY_RANK,
|
|
max_move=0, max_cards=UNLIMITED_CARDS))
|
|
|
|
# define stack-groups
|
|
self.sg.talonstacks = [s.talon] + [s.waste]
|
|
self.sg.openstacks = s.rows + self.sg.talonstacks
|
|
self.sg.dropstacks = s.rows + self.sg.talonstacks
|
|
|
|
|
|
#
|
|
# game overrides
|
|
#
|
|
|
|
def startGame(self):
|
|
self.startDealSample()
|
|
self.s.talon.dealRow(rows=self.s.rows[:21], flip=0)
|
|
self.s.talon.dealRow(rows=self.s.rows[21:])
|
|
self.s.talon.dealCards() # deal first card to WasteStack
|
|
|
|
|
|
# register the game
|
|
registerGame(GameInfo(38, Pyramid, "Pyramid",
|
|
GI.GT_PAIRING_TYPE, 1, 2, GI.SL_MOSTLY_LUCK))
|
|
registerGame(GameInfo(193, RelaxedPyramid, "Relaxed Pyramid",
|
|
GI.GT_PAIRING_TYPE | GI.GT_RELAXED, 1, 2, GI.SL_MOSTLY_LUCK))
|
|
##registerGame(GameInfo(44, Thirteen, "Thirteen",
|
|
## GI.GT_PAIRING_TYPE, 1, 0))
|
|
|