summaryrefslogtreecommitdiffstats
path: root/kpat/klondike.h
blob: 3a7926079a9e164e0a0e6d5edab0967e867b4295 (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
66
67
68
69
70
71
/*
  klondike.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, alternating red and black
//


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

#ifndef P_KLONDIKE
#define P_KLONDIKE

#include "dealer.h"

class KlondikePile;

class Klondike : public Dealer {
    TQ_OBJECT
  

public:
    Klondike( bool easy, TDEMainWindow* parent=0, const char* name=0);

public:
    virtual void restart();
    virtual bool startAutoDrop();

    void redeal(); // put pile back into deck
    void deal();
    void deal3(); // move up to 3 cards from deck to pile

    virtual bool cardClicked(Card *);
    virtual void pileClicked(Pile *c);
    virtual void getHints();

    virtual Card *demoNewCards();

    bool tryToDrop(Card *t);

    virtual bool isGameLost() const;

private:
    bool EasyRules;
    bool redealt;

    Pile* play[7];
    Pile* target[4];

    KlondikePile *pile;
    Deck* deck;
    Card::Rank target_tops[4];
    bool noLongerNeeded(Card::Rank r, Card::Suit s );
};

#endif