-
Notifications
You must be signed in to change notification settings - Fork 0
/
search.h
107 lines (66 loc) · 2.87 KB
/
search.h
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
100
101
102
103
104
105
106
107
/*********************************************************************
*
* 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., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
*
*********************************************************************/
/*********************************************************************
*
* File: search.h
*
* Description: headers of routines that search the state space
*
* Author: Joerg Hoffmann 2000--2002, 2011
*
*********************************************************************/
#ifndef _SEARCH_H
#define _SEARCH_H
Bool do_enforced_hill_climbing( void );
Bool search_for_better_state( State *S, int h, State *S_, int *h_ );
void add_to_ehc_space( State *S, int op, EhcNode *father );
int expand_first_node( int h );
void hash_ehc_node( EhcNode *n );
Bool ehc_state_hashed( State *S );
Bool superior_ehc_state_hashed( State *S );
Bool superior_state( State *S1, State *S2 );
void reset_ehc_hash_entrys( void );
void extract_plan_fragment( State *S );
PlanHashEntry *hash_plan_state( State *S, int step );
PlanHashEntry *plan_state_hashed( State *S );
Bool same_state( State *S1, State *S2 );
void do_best_first_search( void );
void add_to_bfs_space( State *S, int op, BfsNode *father );
void do_weighted_Astar( void );
void add_to_weighted_Astar_space( State *S, int op, BfsNode *father );
// quick fix as it wouldn't allow compiling with do_Astar_epsilon() in main.c
//void do_Astar_epsilon_repairing( void );
void do_Astar_epsilon( void );
BfsNode *Astar_epsilon_select_first( void );
void add_to_Astar_epsilon_space( State *S, int op, BfsNode *father );
Bool extract_plan( BfsNode *last );
void print_open_list( void );
void print_state_trace( BfsNode *n );
void hash_bfs_node( BfsNode *n );
Bool bfs_state_hashed( State *S );
Bool Astar_better_state_hashed( BfsNode *n, float g );
Bool superior_bfs_state_hashed( State *S );
int state_sum( State *S );
int logical_state_sum( State *S );
Bool logical_same_state( State *S1, State *S2 );
Bool result_to_dest( State *dest, State *source, int op );
Bool determine_source_val( State *source, int fl, float *val );
void do_axiom_update( State *dest );
void copy_source_to_dest( State *dest, State *source );
void source_to_dest( State *dest, State *source );
#endif /* _SEARCH_H */