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
|
/*
* Copyright (c) 2001 Mikhail Kourinny (mkourinny@yahoo.com)
*
* 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 __ADVISE_FULL_H
#define __ADVISE_FULL_H
#include <list>
#include <algorithm>
#include "headerP.h"
namespace AdviseFull {
class EquationSet {
public: // Well, why is it necessary?
struct Equation {
std::set<short> pointSets;
short mines;
};
typedef std::map<short, short> Solution;
public:
EquationSet();
EquationSet(AdviseFast::FactSet const &facts);
std::list<Equation> _equations;
std::map<short, CoordSet> _pointSets;
/** Make sure no _pointSets have
* non-empty intersection */
void normalize();
/** Returns in *results a set of equation sets
* which can be solved separately.
* *this assumed normalized :) */
void separate(std::list<EquationSet> *results) const;
/** Solves... returns _pointSets.
* It's nice to have *this separated :) */
std::map<short, CoordSet> const &solve(
std::list<Solution> *results) const;
void prettyprint() const;
private:
/** One more than max(_pointSets[i].first) */
short _maxPointSet;
/** Substitutes a pointSet in all equations */
void substitute(
short out,
std::set<short> const &in);
};
bool surePoints(
std::map<short, CoordSet> const &m,
std::list<EquationSet::Solution> const &l,
CoordSet *surePoints);
/** The fourth argument is a fraction of mines in the "pool" */
void getProbabilities(
std::map<short, CoordSet> const &m,
std::list<EquationSet::Solution> const &l,
ProbabilityMap *probabilities,
float fraction = 0);
/** Get the quotient of the number of variants of
* point distribution satisfying dividend and divisor
* solutions */
/** The fourth argument is a fraction of mines in the "pool" */
float variantNumberFraction(
std::map<short, CoordSet> const &m,
EquationSet::Solution const ÷nd,
EquationSet::Solution const &divisor,
float fraction = 0);
}
#endif
|
