blob: 67d130e8e74ca45acaf9fcb2db44af4522e41602 (
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
72
73
74
75
76
77
78
79
80
81
82
83
84
|
/*
* Quackle -- Crossword game artificial intelligence and analysis tool
* Copyright (C) 2005-2019 Jason Katz-Brown, John O'Laughlin, and John Fultz.
*
* 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/>.
*/
#ifndef QUACKLE_BOGOWINPLAYER_H
#define QUACKLE_BOGOWINPLAYER_H
#include "computerplayer.h"
#include "endgame.h"
namespace Quackle
{
class SmartBogowin : public ComputerPlayer
{
public:
SmartBogowin();
virtual ~SmartBogowin();
virtual Move move();
virtual MoveList moves(int nmoves);
virtual ComputerPlayer *clone() { return new SmartBogowin; }
virtual bool isSlow() const;
virtual bool isUserVisible() const;
virtual double bogopoints(Move &move);
protected:
int minIterations() const;
int maxIterations() const;
Endgame m_endgame;
int m_additionalInitialCandidates;
int m_minIterationsPerSecond;
int m_maxIterationsPerSecond;
int m_nestedMinIterationsPerSecond;
int m_nestedMaxIterationsPerSecond;
bool m_inferring;
};
inline bool SmartBogowin::isSlow() const
{
return true;
}
inline bool SmartBogowin::isUserVisible() const
{
return true;
}
inline int SmartBogowin::minIterations() const
{
if (currentPosition().nestedness() > 0)
return m_nestedMinIterationsPerSecond * m_parameters.secondsPerTurn;
return m_minIterationsPerSecond * m_parameters.secondsPerTurn;
}
inline int SmartBogowin::maxIterations() const
{
if (currentPosition().nestedness() > 0)
return m_nestedMaxIterationsPerSecond * m_parameters.secondsPerTurn;
return m_maxIterationsPerSecond * m_parameters.secondsPerTurn;
}
}
#endif
|
