Fix iterative beam search 2 (#4)

fontanf · May 8, 2024 · 85a4559 · 85a4559
1 parent df1a0a1
commit 85a4559
Showing 1 changed file with 0 additions and 6 deletions.
diff --git a/include/treesearchsolver/iterative_beam_search_2.hpp b/include/treesearchsolver/iterative_beam_search_2.hpp
@@ -155,12 +155,6 @@ inline const IterativeBeamSearch2Output<BranchingScheme> iterative_beam_search_2
                     continue;
                 }
 
-                if ((NodeId)q[current_depth + 1]->size() == output.maximum_size_of_the_queue
-                        && branching_scheme(*(std::prev(q[current_depth + 1]->end())), current_node)) {
-                    stop = false;
-                    break;
-                }
-
                 // Get next child.
                 auto children = branching_scheme.children(current_node);
                 output.number_of_nodes_expanded++;