Update idastar.md

diff --git a/docs/search/idastar.md b/docs/search/idastar.md
index 0eb95fb..eb280cb 100644 (file)
--- a/docs/search/idastar.md
+++ b/docs/search/idastar.md
@@ -12,21 +12,21 @@ IDA\*，即采用迭代加深的 A\*算法。相对于 A\*算法，由于 IDA\*
 ```text
 Procedure IDA_STAR(StartState)
 Begin
-    PathLimit := H(StartState) - 1;
-    Succes := False;
+  PathLimit := H(StartState) - 1;
+  Succes := False;
+  Repeat
+    inc(PathLimit);
+    StartState.g = 0;
+    Push(OpenStack, StartState);
     Repeat
-        inc(PathLimit);
-        StartState.g = 0;
-        Push(OpenStack , StartState);
-        Repeat
-            CurrentState := Pop(OpenStack);
-            If Solution(CurrentState) then
-                Success = True
-            Elseif PathLimit >= CurrentState.g + H(CurrentState) then
-                For each Child(CurrentState) do
-                    Push(OpenStack , Child(CurrentState));
-        until Successor empty(OpenStack);
-    until Success or ResourceLimtsReached;
+      CurrentState := Pop(OpenStack);
+      If Solution(CurrentState) then
+        Success = True
+      Elseif PathLimit >= CurrentState.g + H(CurrentState) then
+        For each Child(CurrentState) do
+          Push(OpenStack, Child(CurrentState));
+    until Successor empty(OpenStack);
+  until Success or ResourceLimtsReached;
 end;
 ```