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
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
|
/*
* Quackle -- Crossword game artificial intelligence and analysis tool
* Copyright (C) 2005-2006 Jason Katz-Brown and John O'Laughlin.
*
* 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; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
* 02110-1301 USA
*/
#ifndef QUACKLE_TESTHARNESS_H
#define QUACKLE_TESTHARNESS_H
#include <QStringList>
#include <datamanager.h>
#include <alphabetparameters.h>
namespace Quackle
{
class ComputerPlayer;
class Game;
class GamePosition;
class Rack;
class GaddagNode;
}
class TestHarness
{
public:
TestHarness();
~TestHarness();
// parse and execute commands specified on command line
void executeFromArguments();
void startUp();
// Loads all positions and runs the computer player on them.
void testPositions();
// Loads all positions and spits out a report on them.
void testReport(bool html);
// Enumerates all racks using a full bag
void enumerateAll();
// Compute bingo stems ala Baron's MMPR
void bingos();
// Loads game from the file, and tests the final position,
// and cleans up the game.
void testFromFile(const QString &file);
// Load racks from a file racks and spit out their static leave values
void staticLeaves(const QString &file);
// Spit out random racks.
void randomRacks();
// Spit out roughish leave values. Leaves come from file leaves.
void leaveCalc(const QString &file);
// Sim a leave.
double leaveSim(const Quackle::Rack &R, int iterations);
// Tests what the computer player does on this position.
void testPosition(const Quackle::GamePosition &position, Quackle::ComputerPlayer *player);
// Anagrams given letters.
void anagram(const QString &letters, bool build);
void wordDump();
// Allocates and loads a game from the file.
Quackle::Game *createNewGame(const QString &filename);
void selfPlayGames(unsigned int seed, unsigned int reps, bool reports, bool playability);
void selfPlayGame(unsigned int gameNumber, bool reports, bool playability);
// Sets the positions that will be tested.
void setPositions(const QStringList &positions)
{
m_positions = positions;
}
Quackle::ComputerPlayer *computerPlayerToTest() const
{
return m_computerPlayerToTest;
}
void setComputerPlayerToTest(Quackle::ComputerPlayer *computerPlayer)
{
m_computerPlayerToTest = computerPlayer;
}
protected:
// void dumpGaddag(const GaddagNode *node, const LetterString &prefix);
QStringList m_positions;
Quackle::DataManager m_dataManager;
Quackle::ComputerPlayer *m_computerPlayerToTest;
bool m_quiet;
QString m_gamesDir;
QString m_lexicon;
QString m_alphabet;
};
#endif
|
