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
use Hash;
/// Defines a goal that can be satisfied by a state.
///
/// Implementing this trait allows the type to be used in a plan.
/// Enums provide the best basis for implementations, as with actions.
///
/// ## Priority
/// Implementing he `priority` method allows multiple goals to be ranked by their importance.
/// It also allows goals to be prioritized dynamically based on the current state.
///
/// ## Heuristic
/// Implementing the `heuristic` method is optional, and it will default to a constant value if not implemented.
/// This method will make the search more efficient, and should not *overestimate* the actual cost.