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
|
// 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 SEARCH_CONFIGURATION_H
#define SEARCH_CONFIGURATION_H
// Controls behaviors of the search that are parameterized by value, not code.
struct SearchConfiguration {
// Should we keep a history of where we've been?
// Defaults to true.
// If false:
// Nodes are always without parent, so the search cannot find paths.
// States that have been visited and expanded may be visited and expanded
// again.
bool useClosed;
// Should we allow a parent to consider itself its own child?
// Defaults to false.
// If true:
// Node's states are forcibly added to their own sets of children.
// Filters can therefore choose the trivial (no-move) transition, like in
// hill-climbing.
// The search may spin at local maxima.
bool retryChildren;
// Should we limit the number of children by a proportion rather than a count?
// Defaults to true.
// If true:
// The state space is asked to enumerate a fixed proportion of children.
// States with more children will have longer enumerations.
// If false:
// The state space is asked to enumerate a fixed number of children.
// States with too few children will have all of them listed.
// States with too many children will not.
bool proportionChildren;
// How many children should we ask for?
// (See the documentation of proportionChildren above.)
union {
float proportion;
unsigned count;
} childrenAsk;
// How many iterations before each pruning of the space?
// Defaults to zero, which is treated as infinity.
// If nonzero:
// After the given number of iterations, the search will forget all visits
// except for the best nodes in the closed and open sets.
// This is sometimes an appropriate way to trade performance for memory.
unsigned prunePeriod;
SearchConfiguration() :
useClosed(true),
retryChildren(false),
proportionChildren(true),
prunePeriod(0) {
childrenAsk.proportion = 1;
}
SearchConfiguration
(bool useClosed,
bool retryChildren,
float proportion,
unsigned prunePeriod) :
useClosed(useClosed),
retryChildren(retryChildren),
proportionChildren(true),
prunePeriod(prunePeriod) {
childrenAsk.proportion = proportion;
}
SearchConfiguration
(bool useClosed,
bool retryChildren,
unsigned count,
unsigned prunePeriod) :
useClosed(useClosed),
retryChildren(retryChildren),
proportionChildren(false),
prunePeriod(prunePeriod) {
childrenAsk.count = count;
}
};
#endif
|
