blob: 61214b8799e8f866b88c5c9ff79cbf32e1e39617 (
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
|
// Copyright 2008, 2009 Brady J. Garvin
// This file is part of Covering Arrays by Simulated Annealing (CASA).
// CASA 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.
// CASA 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 CASA. If not, see <http://www.gnu.org/licenses/>.
#ifndef COVERING_ARRAY_HEURISTIC_H
#define COVERING_ARRAY_HEURISTIC_H
#include "search/Heuristic.H"
#include "covering/state/CoveringArray.H"
#include "covering/goal/CoverageGoal.H"
class CoveringArrayHeuristic : public Heuristic<CoveringArray, CoverageCost> {
CoverageCost estimate
(const CoveringArray&state, const Goal<CoveringArray>&goal) const {
unsigned targetCoverage = ((CoverageGoal&)goal).getTargetCoverage();
return CoverageCost
(targetCoverage - state.getCoverageCount(),
state.getMultipleCoverageCount());
}
};
#endif
|