summaryrefslogtreecommitdiffstats
path: root/kpat/grandf.h
blob: 59091f14d3f5be7368838b7a696b9cbf417000d6 (plain)
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
/*
  grandf.cpp  implements a patience card game

     Copyright (C) 1995  Paul Olav Tvete

 * 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.


//
// 7 positions, all cards on table, follow suit
// ( I don't know a name for this one, but I learned it from my grandfather.)

****************************************/


#ifndef P_GRANDF_7
#define P_GRANDF_7

#include "dealer.h"

class TDEAction;
class Pile;
class Deck;
class TDEMainWindow;

class Grandf : public Dealer {
    TQ_OBJECT
  

public:
    Grandf( TDEMainWindow* parent=0, const char* name=0);

public slots:
    void redeal();
    void deal();
    virtual void restart();
    virtual bool isGameLost() const;


protected:
    void collect();
    virtual bool checkAdd   ( int checkIndex, const Pile *c1, const CardList& c2) const;
    virtual TQString getGameState() const;
    virtual void setGameState( const TQString & stream );
    virtual Card *demoNewCards();

private:
    Pile* store[7];
    Pile* target[4];
    Deck *deck;
    int numberOfDeals;

};

#endif