mirror of
https://github.com/shlomif/PySolFC.git
synced 2025-04-05 00:02:29 -04:00
175410e2d0
* changed talon/waste text anchor: `ss' -> `s', `nn' -> `n' * fixed support python 2.2 and tk 8.3 git-svn-id: file:///home/shlomif/Backup/svn-dumps/PySolFC/svnsync-repos/pysolfc/PySolFC/trunk@43 efabe8c0-fbe8-4139-b769-b5e6d273206e
261 lines
8.3 KiB
Python
261 lines
8.3 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
|
|
|
|
# /***********************************************************************
|
|
# //
|
|
# ************************************************************************/
|
|
|
|
class Pegged_Hint(AbstractHint):
|
|
# FIXME: no intelligence whatsoever is implemented here
|
|
def computeHints(self):
|
|
game = self.game
|
|
# get free stacks
|
|
stacks = filter(lambda r: not r.cards, game.s.rows)
|
|
#
|
|
for t in stacks:
|
|
for dx, dy in game.STEPS:
|
|
r = game.map.get((t.pos[0] + dx, t.pos[1] + dy))
|
|
if not r or not r.cards or not t.acceptsCards(r, r.cards):
|
|
continue
|
|
# braindead scoring...
|
|
score = 10000 + game.app.miscrandom.randint(0, 9999)
|
|
self.addHint(score, 1, r, t)
|
|
|
|
|
|
# /***********************************************************************
|
|
# //
|
|
# ************************************************************************/
|
|
|
|
class Pegged_RowStack(ReserveStack):
|
|
def acceptsCards(self, from_stack, cards):
|
|
if not ReserveStack.acceptsCards(self, from_stack, cards):
|
|
return 0
|
|
return self._getMiddleStack(from_stack) is not None
|
|
|
|
def canDropCards(self, stacks):
|
|
return (None, 0)
|
|
|
|
def moveMove(self, ncards, to_stack, frames=-1, shadow=-1):
|
|
other_stack = to_stack._getMiddleStack(self)
|
|
old_state = self.game.enterState(self.game.S_FILL)
|
|
f = self.game.s.foundations[0]
|
|
self.game.moveMove(ncards, self, to_stack, frames=0)
|
|
self.game.playSample("drop", priority=200)
|
|
self.game.moveMove(ncards, other_stack, f, frames=-1, shadow=shadow)
|
|
self.game.leaveState(old_state)
|
|
self.fillStack()
|
|
other_stack.fillStack()
|
|
|
|
def _getMiddleStack(self, from_stack):
|
|
dx, dy = from_stack.pos[0] - self.pos[0], from_stack.pos[1] - self.pos[1]
|
|
if not self.game.STEP_MAP.get((dx, dy)):
|
|
return None
|
|
s = self.game.map.get((self.pos[0] + dx/2, self.pos[1] + dy/2))
|
|
if not s or not s.cards:
|
|
return None
|
|
return s
|
|
|
|
def copyModel(self, clone):
|
|
ReserveStack.copyModel(self, clone)
|
|
clone.pos = self.pos
|
|
|
|
|
|
# /***********************************************************************
|
|
# // Pegged
|
|
# ************************************************************************/
|
|
|
|
class Pegged(Game):
|
|
Hint_Class = Pegged_Hint
|
|
|
|
STEPS = ((-4, 0), (4, 0), (0, -4), (0, 4))
|
|
ROWS = (3, 5, 7, 7, 7, 5, 3)
|
|
EMPTY_STACK_ID = -1
|
|
|
|
#
|
|
# game layout
|
|
#
|
|
|
|
def createGame(self):
|
|
# create layout
|
|
l, s = Layout(self), self.s
|
|
|
|
# set window
|
|
n = m = max(self.ROWS)
|
|
if self.ROWS[0] == m or self.ROWS[-1] == m:
|
|
n = n + 1
|
|
self.setSize(l.XM + n*l.XS, l.YM + len(self.ROWS)*l.YS)
|
|
|
|
# game extras 1)
|
|
self.map = {}
|
|
|
|
# create stacks
|
|
for i in range(len(self.ROWS)):
|
|
r = self.ROWS[i]
|
|
for j in range(r):
|
|
d = m - r + 2*j
|
|
x, y = l.XM + d*l.XS/2, l.YM + i*l.YS
|
|
stack = Pegged_RowStack(x, y, self)
|
|
stack.pos = (d, 2*i)
|
|
##print stack.id, stack.pos
|
|
s.rows.append(stack)
|
|
self.map[stack.pos] = stack
|
|
x, y = self.width - l.XS, l.YM
|
|
s.foundations.append(AbstractFoundationStack(x, y, self, ANY_SUIT, max_move=0, max_accept=0, max_cards=self.gameinfo.ncards))
|
|
l.createText(s.foundations[0], "s")
|
|
y = self.height - l.YS
|
|
s.talon = InitialDealTalonStack(x, y, self)
|
|
s.internals.append(InvisibleStack(self))
|
|
|
|
# game extras 2)
|
|
self.STEP_MAP = {}
|
|
for step in self.STEPS:
|
|
self.STEP_MAP[step] = 1
|
|
if self.EMPTY_STACK_ID < 0:
|
|
self.EMPTY_STACK_ID = len(s.rows) / 2
|
|
|
|
# Define stack groups
|
|
l.defaultStackGroups()
|
|
|
|
|
|
#
|
|
# game overrides
|
|
#
|
|
|
|
def startGame(self):
|
|
n = len(self.cards) - len(self.s.rows) + 1
|
|
if n > 0:
|
|
self.moveMove(n, self.s.talon, self.s.internals[0], frames=0)
|
|
self.startDealSample()
|
|
rows = list(self.s.rows[:])
|
|
rows.remove(rows[self.EMPTY_STACK_ID])
|
|
self.s.talon.dealRow(rows=rows, frames=4)
|
|
assert len(self.s.talon.cards) == 0
|
|
|
|
def isGameWon(self):
|
|
c = 0
|
|
for s in self.s.foundations:
|
|
c = c + len(s.cards)
|
|
return c + 2 == self.gameinfo.si.ncards
|
|
|
|
def getAutoStacks(self, event=None):
|
|
return ((), (), ())
|
|
|
|
# Pegged special: check for a perfect game
|
|
def getWinStatus(self):
|
|
won, status, updated = Game.getWinStatus(self)
|
|
if status == 2:
|
|
stacks = filter(lambda r: r.cards, self.s.rows)
|
|
assert len(stacks) == 1
|
|
if stacks[0].id != self.EMPTY_STACK_ID:
|
|
# not perfect
|
|
return won, 1, self.U_WON
|
|
return won, status, updated
|
|
|
|
# Pegged special: highlight all moveable cards
|
|
def getHighlightPilesStacks(self):
|
|
rows = []
|
|
for r in self.s.rows:
|
|
if not r.cards:
|
|
continue
|
|
rx, ry = r.pos
|
|
for dx, dy in self.STEPS:
|
|
s = self.map.get((rx + dx, ry + dy))
|
|
if s and not s.cards:
|
|
m = self.map.get((rx + dx/2, ry + dy/2))
|
|
if m and m.cards:
|
|
rows.append(r)
|
|
return ((rows, 1),)
|
|
|
|
|
|
class PeggedCross1(Pegged):
|
|
ROWS = (3, 3, 7, 7, 7, 3, 3)
|
|
|
|
class PeggedCross2(Pegged):
|
|
ROWS = (3, 3, 3, 9, 9, 9, 3, 3, 3)
|
|
|
|
class Pegged6x6(Pegged):
|
|
EMPTY_STACK_ID = 14
|
|
ROWS = (6, 6, 6, 6, 6, 6)
|
|
|
|
class Pegged7x7(Pegged):
|
|
ROWS = (7, 7, 7, 7, 7, 7, 7)
|
|
|
|
|
|
# /***********************************************************************
|
|
# // Pegged Triangle
|
|
# ************************************************************************/
|
|
|
|
class PeggedTriangle1(Pegged):
|
|
STEPS = ((-2, -4), (-2, 4), (-4, 0), (4, 0), (2, -4), (2, 4))
|
|
ROWS = (1, 2, 3, 4, 5)
|
|
EMPTY_STACK_ID = 4
|
|
|
|
class PeggedTriangle2(PeggedTriangle1):
|
|
ROWS = (1, 2, 3, 4, 5, 6)
|
|
|
|
|
|
# /***********************************************************************
|
|
# // register the games
|
|
# ************************************************************************/
|
|
|
|
def r(id, gameclass, name):
|
|
si_ncards = 0
|
|
for n in gameclass.ROWS:
|
|
si_ncards = si_ncards + n
|
|
gi = GameInfo(id, gameclass, name,
|
|
GI.GT_PUZZLE_TYPE, 1, 0, GI.SL_SKILL,
|
|
si={"ncards": si_ncards},
|
|
rules_filename = "pegged.html")
|
|
registerGame(gi)
|
|
return gi
|
|
|
|
r(180, Pegged, "Pegged")
|
|
r(181, PeggedCross1, "Pegged Cross 1")
|
|
r(182, PeggedCross2, "Pegged Cross 2")
|
|
r(183, Pegged6x6, "Pegged 6x6")
|
|
r(184, Pegged7x7, "Pegged 7x7")
|
|
r(210, PeggedTriangle1, "Pegged Triangle 1")
|
|
r(211, PeggedTriangle2, "Pegged Triangle 2")
|
|
|
|
del r
|