|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
Result of one threshold pass of IDA*. More...
#include <State_Search_IDA_Star.H>
Public Attributes | |
| Distance | threshold = Distance{} |
| F-cost threshold used for this pass. | |
| size_t | visited_states = 0 |
| States visited during this pass. | |
| bool | found_solution = false |
| True if a goal was reached at or below threshold. | |
| Distance | next_threshold = Distance{} |
Minimum f-value that exceeded threshold. | |
Result of one threshold pass of IDA*.
Each pass is a depth-limited DFS with a fixed f-cost threshold. This struct records how many states were visited, whether a solution was found and what the next threshold should be.
| Distance | numeric cost type from the domain. |
Definition at line 86 of file State_Search_IDA_Star.H.
True if a goal was reached at or below threshold.
Definition at line 90 of file State_Search_IDA_Star.H.
Referenced by Aleph::IDA_Star_State_Search< Domain >::search().
| Distance Aleph::IDAStarIteration< Distance >::next_threshold = Distance{} |
Minimum f-value that exceeded threshold.
Definition at line 91 of file State_Search_IDA_Star.H.
Referenced by Aleph::IDA_Star_State_Search< Domain >::search().
F-cost threshold used for this pass.
Definition at line 88 of file State_Search_IDA_Star.H.
Referenced by Aleph::IDA_Star_State_Search< Domain >::search().
| size_t Aleph::IDAStarIteration< Distance >::visited_states = 0 |
States visited during this pass.
Definition at line 89 of file State_Search_IDA_Star.H.
Referenced by Aleph::IDA_Star_State_Search< Domain >::search().