|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
Counters collected during a search run. More...
#include <state_search_common.H>
Public Attributes | |
| size_t | visited_states = 0 |
| Number of states entered by the engine. | |
| size_t | expanded_states = 0 |
| Number of non-terminal states expanded. | |
| size_t | generated_successors = 0 |
| Number of successor moves emitted. | |
| size_t | solutions_found = 0 |
| Number of goal states accepted. | |
| size_t | terminal_states = 0 |
| Non-solution terminal states cut by the domain. | |
| size_t | pruned_by_depth = 0 |
| States not expanded due to max depth. | |
| size_t | pruned_by_domain = 0 |
| States discarded by domain-side pruning. | |
| size_t | pruned_by_visited = 0 |
| States skipped because already seen (visited-set duplicate suppression). | |
| size_t | limit_hits = 0 |
| Number of hard-limit stops triggered. | |
| size_t | max_depth_reached = 0 |
| Deepest path depth visited. | |
| double | elapsed_ms = 0.0 |
| Wall-clock time spent inside the search call. | |
| MoveOrderingStats | move_ordering |
| Successor-ordering activity for this run. | |
Counters collected during a search run.
Definition at line 246 of file state_search_common.H.
| double Aleph::SearchStats::elapsed_ms = 0.0 |
Wall-clock time spent inside the search call.
Definition at line 258 of file state_search_common.H.
Referenced by Aleph::Depth_First_Backtracking< Domain >::search(), Aleph::Branch_And_Bound< Domain, ObjectivePolicy >::search(), Aleph::IDA_Star_State_Search< Domain >::search(), Aleph::Branch_And_Bound< Domain, ObjectivePolicy >::search(), Aleph::Depth_First_Backtracking< Domain >::search(), Aleph::Negamax< Domain >::search_impl(), and Aleph::Alpha_Beta< Domain >::search_impl().
| size_t Aleph::SearchStats::expanded_states = 0 |
Number of non-terminal states expanded.
Definition at line 249 of file state_search_common.H.
Referenced by Aleph::ida_star_detail::dfs(), Aleph::Depth_First_Backtracking< Domain >::dfs(), Aleph::Branch_And_Bound< Domain, ObjectivePolicy >::dfs(), Aleph::Branch_And_Bound< Domain, ObjectivePolicy >::dfs_visited(), Aleph::Depth_First_Backtracking< Domain >::dfs_visited(), Aleph::Branch_And_Bound< Domain, ObjectivePolicy >::search_best_first(), Aleph::Negamax< Domain >::search_node(), and Aleph::Alpha_Beta< Domain >::search_node().
| size_t Aleph::SearchStats::generated_successors = 0 |
Number of successor moves emitted.
Definition at line 250 of file state_search_common.H.
Referenced by Aleph::Branch_And_Bound< Domain, ObjectivePolicy >::apply_move_and_recurse(), Aleph::ida_star_detail::dfs(), Aleph::Depth_First_Backtracking< Domain >::dfs(), Aleph::Depth_First_Backtracking< Domain >::dfs_visited(), Aleph::Branch_And_Bound< Domain, ObjectivePolicy >::search_best_first(), Aleph::Negamax< Domain >::search_node(), and Aleph::Alpha_Beta< Domain >::search_node().
| size_t Aleph::SearchStats::limit_hits = 0 |
Number of hard-limit stops triggered.
Definition at line 256 of file state_search_common.H.
Referenced by Aleph::ida_star_detail::dfs().
| size_t Aleph::SearchStats::max_depth_reached = 0 |
Deepest path depth visited.
Definition at line 257 of file state_search_common.H.
Referenced by Aleph::ida_star_detail::dfs(), Aleph::Depth_First_Backtracking< Domain >::dfs(), and Aleph::Depth_First_Backtracking< Domain >::dfs_visited().
| MoveOrderingStats Aleph::SearchStats::move_ordering |
Successor-ordering activity for this run.
Definition at line 259 of file state_search_common.H.
Referenced by Aleph::Alpha_Beta< Domain >::collect_ordered_moves(), and Aleph::Branch_And_Bound< Domain, ObjectivePolicy >::collect_ordered_moves().
| size_t Aleph::SearchStats::pruned_by_depth = 0 |
States not expanded due to max depth.
Definition at line 253 of file state_search_common.H.
Referenced by Aleph::ida_star_detail::dfs(), Aleph::Depth_First_Backtracking< Domain >::dfs(), Aleph::Branch_And_Bound< Domain, ObjectivePolicy >::dfs(), Aleph::Branch_And_Bound< Domain, ObjectivePolicy >::dfs_visited(), Aleph::Depth_First_Backtracking< Domain >::dfs_visited(), Aleph::Branch_And_Bound< Domain, ObjectivePolicy >::process_best_first_candidate(), Aleph::Negamax< Domain >::search_node(), and Aleph::Alpha_Beta< Domain >::search_node().
| size_t Aleph::SearchStats::pruned_by_domain = 0 |
States discarded by domain-side pruning.
Definition at line 254 of file state_search_common.H.
Referenced by Aleph::ida_star_detail::dfs(), Aleph::Depth_First_Backtracking< Domain >::dfs(), Aleph::Branch_And_Bound< Domain, ObjectivePolicy >::dfs(), Aleph::Branch_And_Bound< Domain, ObjectivePolicy >::dfs_visited(), Aleph::Depth_First_Backtracking< Domain >::dfs_visited(), Aleph::Branch_And_Bound< Domain, ObjectivePolicy >::process_best_first_candidate(), Aleph::Negamax< Domain >::search_node(), Aleph::Alpha_Beta< Domain >::search_node(), and TEST().
| size_t Aleph::SearchStats::pruned_by_visited = 0 |
States skipped because already seen (visited-set duplicate suppression).
Definition at line 255 of file state_search_common.H.
Referenced by Aleph::Depth_First_Backtracking< Domain >::dfs_visited().
| size_t Aleph::SearchStats::solutions_found = 0 |
Number of goal states accepted.
Definition at line 251 of file state_search_common.H.
Referenced by Aleph::ida_star_detail::dfs(), Aleph::Depth_First_Backtracking< Domain >::dfs(), Aleph::Depth_First_Backtracking< Domain >::dfs_visited(), and Aleph::Branch_And_Bound< Domain, ObjectivePolicy >::handle_complete_solution().
| size_t Aleph::SearchStats::terminal_states = 0 |
Non-solution terminal states cut by the domain.
Definition at line 252 of file state_search_common.H.
Referenced by Aleph::ida_star_detail::dfs(), Aleph::Depth_First_Backtracking< Domain >::dfs(), Aleph::Branch_And_Bound< Domain, ObjectivePolicy >::dfs(), Aleph::Branch_And_Bound< Domain, ObjectivePolicy >::dfs_visited(), Aleph::Depth_First_Backtracking< Domain >::dfs_visited(), Aleph::Branch_And_Bound< Domain, ObjectivePolicy >::process_best_first_candidate(), Aleph::Negamax< Domain >::search_node(), Aleph::Alpha_Beta< Domain >::search_node(), and TEST().
| size_t Aleph::SearchStats::visited_states = 0 |
Number of states entered by the engine.
Definition at line 248 of file state_search_common.H.
Referenced by Aleph::ida_star_detail::dfs(), Aleph::Depth_First_Backtracking< Domain >::dfs(), Aleph::Depth_First_Backtracking< Domain >::dfs_visited(), Aleph::IDA_Star_State_Search< Domain >::search(), and TEST().