mirror of
https://github.com/shlomif/PySolFC.git
synced 2025-04-05 00:02:29 -04:00
ed18fd8156
Tested on ci. See https://github.com/PyCQA/flake8-import-order . In the process did some other cleanups and https://en.wikipedia.org/wiki/Code_refactoring .
106 lines
3.4 KiB
Python
106 lines
3.4 KiB
Python
#!/usr/bin/env python
|
|
# -*- mode: python; coding: utf-8; -*-
|
|
# ---------------------------------------------------------------------------
|
|
#
|
|
# Copyright (C) 1998-2003 Markus Franz Xaver Johannes Oberhumer
|
|
# Copyright (C) 2003 Mt. Hood Playing Card Co.
|
|
# Copyright (C) 2005-2009 Skomoroh
|
|
#
|
|
# 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 3 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/>.
|
|
#
|
|
# ---------------------------------------------------------------------------
|
|
|
|
import pysollib.game
|
|
from pysollib.game import Game
|
|
from pysollib.gamedb import GI, GameInfo, registerGame
|
|
from pysollib.layout import Layout
|
|
from pysollib.stack import \
|
|
AbstractFoundationStack, \
|
|
SequenceRowStack, \
|
|
WasteStack, \
|
|
WasteTalonStack
|
|
from pysollib.util import ANY_RANK, ANY_SUIT
|
|
|
|
# ************************************************************************
|
|
# * Simplex
|
|
# ************************************************************************
|
|
|
|
|
|
def isSameRankSequence(cards):
|
|
c0 = cards[0]
|
|
for c in cards[1:]:
|
|
if c0.rank != c.rank:
|
|
return False
|
|
return True
|
|
|
|
|
|
class Simplex_Foundation(AbstractFoundationStack):
|
|
def acceptsCards(self, from_stack, cards):
|
|
if len(cards) != 4:
|
|
return False
|
|
return isSameRankSequence(cards)
|
|
|
|
|
|
class Simplex_RowStack(SequenceRowStack):
|
|
def canDropCards(self, stacks):
|
|
if len(self.cards) != 4:
|
|
return (None, 0)
|
|
for s in stacks:
|
|
if s is not self and s.acceptsCards(self, self.cards):
|
|
return (s, 4)
|
|
return (None, 0)
|
|
|
|
def _isSequence(self, cards):
|
|
return isSameRankSequence(cards)
|
|
|
|
|
|
class Simplex(pysollib.game.StartDealRowAndCards, Game):
|
|
|
|
def createGame(self, reserves=6):
|
|
# create layout
|
|
l, s = Layout(self), self.s
|
|
|
|
# set window
|
|
w, h = l.XM+10*l.XS, l.YM+2*l.YS+4*l.YOFFSET+l.TEXT_HEIGHT
|
|
self.setSize(w, h)
|
|
|
|
# create stacks
|
|
x, y = l.XM, l.YM
|
|
s.talon = WasteTalonStack(x, y, self, max_rounds=1)
|
|
l.createText(s.talon, 's')
|
|
x += l.XS
|
|
s.waste = WasteStack(x, y, self)
|
|
l.createText(s.waste, 's')
|
|
x += l.XS
|
|
stack = Simplex_Foundation(
|
|
x, y, self,
|
|
suit=ANY_SUIT, base_rank=ANY_RANK, max_cards=52)
|
|
xoffset = (self.width-3*l.XS)//51
|
|
stack.CARD_XOFFSET, stack.CARD_YOFFSET = xoffset, 0
|
|
s.foundations.append(stack)
|
|
x, y = l.XM, l.YM+l.YS+l.TEXT_HEIGHT
|
|
for i in range(9):
|
|
s.rows.append(Simplex_RowStack(x, y, self))
|
|
x += l.XS
|
|
|
|
# define stack-groups
|
|
l.defaultStackGroups()
|
|
|
|
def shallHighlightMatch(self, stack1, card1, stack2, card2):
|
|
return card1.rank == card2.rank
|
|
|
|
|
|
# register the game
|
|
registerGame(GameInfo(436, Simplex, "Simplex",
|
|
GI.GT_1DECK_TYPE, 1, 0, GI.SL_MOSTLY_LUCK))
|