summaryrefslogtreecommitdiffstats
path: root/kpat/napoleon.h
blob: d097d6acfc9b7da5e94717cf4aaccbbe96512792 (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
/***********************-*-C++-*-********

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

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


#ifndef P_NAPOLEON
#define P_NAPOLEON

#include "dealer.h"

class Napoleon : public Dealer {
    Q_OBJECT
  TQ_OBJECT
public:
    Napoleon (KMainWindow* tqparent=0, const char* name=0);

    virtual void restart();
    virtual void getHints();
    virtual Card *demoNewCards();
    virtual bool startAutoDrop() { return false; }
    virtual bool isGameLost() const;

public slots:
    void deal1(Card *c);

private:
    void deal();

    bool CanPutTarget( const Pile *c1, const CardList& c2) const;
    bool CanPutCentre( const Pile* c1, const CardList& c2) const;

    virtual bool checkAdd   ( int checkIndex, const Pile *c1, const CardList& c2) const;

    Pile* pile;
    Pile* target[4];
    Pile* centre;
    Pile* store[4];
    Deck* deck;
};

#endif