diff --git a/alib2graph_algo/src/shortest_path/IDAStar.hpp b/alib2graph_algo/src/shortest_path/IDAStar.hpp
index 34e94c230a7137432989125f0aa0c0fff0b5941a..1d862e3ee56dc5c64a9eebe445797aa480408621 100644
--- a/alib2graph_algo/src/shortest_path/IDAStar.hpp
+++ b/alib2graph_algo/src/shortest_path/IDAStar.hpp
@@ -115,7 +115,7 @@ IDAStar::findPath(const TGraph &graph,
   data.path_set.insert(start);
 
   weight_type bound = f_heuristic(start);
-  while (1) {
+  while ( true ) {
     bool found;
     weight_type t;
     ext::tie(found, t) = search(graph, data, goal, 0, bound, f_heuristic, f_user);