Search in CISpace

Breadth-First Search

1   Name: S     Path: S
     Cost (g(n)): 0     Heuristics (h(n)): 26.0     f(n): 26.0
2   Name: N1     Path: S --> N1
     Cost (g(n)): 9.9     Heuristics (h(n)): 25.1     f(n): 35.0
3   Name: N2     Path: S --> N2
     Cost (g(n)): 10.6     Heuristics (h(n)): 16.4     f(n): 27.0
4   Name: N3     Path: S --> N1 --> N3
     Cost (g(n)): 21.8     Heuristics (h(n)): 27.6     f(n): 49.400000000000006
5   Name: N4     Path: S --> N1 --> N4
     Cost (g(n)): 19.0     Heuristics (h(n)): 18.1     f(n): 37.1
6   Name: N5     Path: S --> N2 --> N5
     Cost (g(n)): 19.7     Heuristics (h(n)): 8.8     f(n): 28.5
7   Name: N6     Path: S --> N2 --> N6
     Cost (g(n)): 23.4     Heuristics (h(n)): 8.5     f(n): 31.9
8   Name: N7     Path: S --> N1 --> N3 --> N7
     Cost (g(n)): 31.4     Heuristics (h(n)): 28.0     f(n): 59.4
9   Name: N8     Path: S --> N1 --> N4 --> N8
     Cost (g(n)): 27.700000000000003     Heuristics (h(n)): 18.7     f(n): 46.400000000000006
10   Name: N9     Path: S --> N2 --> N5 --> N9
     Cost (g(n)): 28.299999999999997     Heuristics (h(n)): 10.0     f(n): 38.3
11   Name: G     Path: S --> N2 --> N5 --> G
     Cost (g(n)): 28.5     Heuristics (h(n)): 0.0     f(n): 28.5

Options: Maximum number of search steps: 100
		 No pruning