1 files changed, 93 insertions, 0 deletions
diff --git a/kmines/solver/adviseFull.h b/kmines/solver/adviseFull.h
new file mode 100644
index 00000000..2b0cc97b
--- /dev/null
+++ b/kmines/solver/adviseFull.h
@@ -0,0 +1,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 &dividend,
+        EquationSet::Solution const &divisor,
+        float fraction = 0);
+}
+
+#endif