@@ -13,124 +13,124 @@ The file [aima3e-algorithms.pdf](https://github.com/aimacode/pseudocode/blob/mas
13
13
<tr >
14
14
<td align="center">•</td>
15
15
<td align="center"></td>
16
- <td><a href="Table-Driven-Agent.md">TABLE-DRIVEN-AGENT</a></td>
16
+ <td><a href="md/ Table-Driven-Agent.md">TABLE-DRIVEN-AGENT</a></td>
17
17
</tr >
18
18
<tr >
19
19
<td align="center">•</td>
20
20
<td align="center"></td>
21
- <td><a href="Reflex-Vacuum-Agent.md">REFLEX-VACUUM-AGENT</a></td>
21
+ <td><a href="md/ Reflex-Vacuum-Agent.md">REFLEX-VACUUM-AGENT</a></td>
22
22
</tr >
23
23
<tr >
24
24
<td align="center">•</td>
25
25
<td align="center"></td>
26
- <td><a href="Simple-Reflex-Agent.md">SIMPLE-REFLEX-AGENT</a></td>
26
+ <td><a href="md/ Simple-Reflex-Agent.md">SIMPLE-REFLEX-AGENT</a></td>
27
27
</tr >
28
28
<tr >
29
29
<td align="center">•</td>
30
30
<td align="center"></td>
31
- <td><a href="Model-Based-Reflex-Agent.md">MODEL-BASED-REFLEX-AGENT</a></td>
31
+ <td><a href="md/ Model-Based-Reflex-Agent.md">MODEL-BASED-REFLEX-AGENT</a></td>
32
32
</tr >
33
33
<tr >
34
34
<td colspan="3"><hr/></td>
35
35
</tr >
36
36
<tr >
37
37
<td align="center">•</td>
38
38
<td align="center"></td>
39
- <td><a href="Simple-Problem-Solving-Agent.md">SIMPLE-PROBLEM-SOLVING-AGENT</a></td>
39
+ <td><a href="md/ Simple-Problem-Solving-Agent.md">SIMPLE-PROBLEM-SOLVING-AGENT</a></td>
40
40
</tr >
41
41
<tr >
42
42
<td align="center">•</td>
43
43
<td align="center"></td>
44
- <td><a href="Tree-Search-and-Graph-Search.md">TREE-SEARCH and GRAPH-SEARCH</a></td>
44
+ <td><a href="md/ Tree-Search-and-Graph-Search.md">TREE-SEARCH and GRAPH-SEARCH</a></td>
45
45
</tr >
46
46
<tr >
47
47
<td align="center">•</td>
48
48
<td align="center"></td>
49
- <td><a href="Breadth-First-Search.md">BREADTH-FIRST-SEARCH</a></td>
49
+ <td><a href="md/ Breadth-First-Search.md">BREADTH-FIRST-SEARCH</a></td>
50
50
</tr >
51
51
<tr >
52
52
<td align="center">•</td>
53
53
<td align="center"></td>
54
- <td><a href="Uniform-Cost-Search.md">UNIFORM-COST-SEARCH</a></td>
54
+ <td><a href="md/ Uniform-Cost-Search.md">UNIFORM-COST-SEARCH</a></td>
55
55
</tr >
56
56
<tr >
57
57
<td align="center">•</td>
58
58
<td align="center"></td>
59
- <td><a href="Depth-Limited-Search.md">DEPTH-LIMITED-SEARCH</a></td>
59
+ <td><a href="md/ Depth-Limited-Search.md">DEPTH-LIMITED-SEARCH</a></td>
60
60
</tr >
61
61
<tr >
62
62
<td align="center">•</td>
63
63
<td align="center"></td>
64
- <td><a href="Iterative-Deepening-Search.md">ITERATIVE-DEEPENING-SEARCH</a></td>
64
+ <td><a href="md/ Iterative-Deepening-Search.md">ITERATIVE-DEEPENING-SEARCH</a></td>
65
65
</tr >
66
66
<tr >
67
67
<td align="center">•</td>
68
68
<td align="center"></td>
69
- <td><a href="Recursive-Best-First-Search.md">RECURSIVE-BEST-FIRST-SEARCH</a></td>
69
+ <td><a href="md/ Recursive-Best-First-Search.md">RECURSIVE-BEST-FIRST-SEARCH</a></td>
70
70
</tr >
71
71
<tr >
72
72
<td colspan="3"><hr/></td>
73
73
</tr >
74
74
<tr >
75
75
<td align="center">•</td>
76
76
<td align="center"></td>
77
- <td><a href="Hill-Climbing.md">HILL-CLIMBING</a></td>
77
+ <td><a href="md/ Hill-Climbing.md">HILL-CLIMBING</a></td>
78
78
</tr >
79
79
<tr >
80
80
<td align="center">•</td>
81
81
<td align="center"></td>
82
- <td><a href="Simulated-Annealing.md">SIMULATED-ANNEALING</a></td>
82
+ <td><a href="md/ Simulated-Annealing.md">SIMULATED-ANNEALING</a></td>
83
83
</tr >
84
84
<tr >
85
85
<td align="center">•</td>
86
86
<td align="center"></td>
87
- <td><a href="Genetic-Algorithm.md">GENETIC-ALGORITHM</a></td>
87
+ <td><a href="md/ Genetic-Algorithm.md">GENETIC-ALGORITHM</a></td>
88
88
</tr >
89
89
<tr >
90
90
<td align="center">•</td>
91
91
<td align="center"></td>
92
- <td><a href="And-Or-Graph-Search.md">AND-OR-GRAPH-SEARCH</a></td>
92
+ <td><a href="md/ And-Or-Graph-Search.md">AND-OR-GRAPH-SEARCH</a></td>
93
93
</tr >
94
94
<tr >
95
95
<td align="center">•</td>
96
96
<td align="center"></td>
97
- <td><a href="Online-DFS-Agent.md">ONLINE-DFS-AGENT</a></td>
97
+ <td><a href="md/ Online-DFS-Agent.md">ONLINE-DFS-AGENT</a></td>
98
98
</tr >
99
99
<tr >
100
100
<td align="center">•</td>
101
101
<td align="center"></td>
102
- <td><a href="LRTAStar-Agent.md">LRTA*-AGENT</a></td>
102
+ <td><a href="md/ LRTAStar-Agent.md">LRTA*-AGENT</a></td>
103
103
</tr >
104
104
<tr >
105
105
<td colspan="3"><hr/></td>
106
106
</tr >
107
107
<tr >
108
108
<td align="center">•</td>
109
109
<td align="center"></td>
110
- <td><a href="Minimax-Decision.md">MINIMAX-DECISION</a></td>
110
+ <td><a href="md/ Minimax-Decision.md">MINIMAX-DECISION</a></td>
111
111
</tr >
112
112
<tr >
113
113
<td align="center">•</td>
114
114
<td align="center"></td>
115
- <td><a href="Alpha-Beta-Search.md">ALPHA-BETA-SEARCH</a></td>
115
+ <td><a href="md/ Alpha-Beta-Search.md">ALPHA-BETA-SEARCH</a></td>
116
116
</tr >
117
117
<tr >
118
118
<td colspan="3"><hr/></td>
119
119
</tr >
120
120
<tr >
121
121
<td align="center">•</td>
122
122
<td align="center"></td>
123
- <td><a href="AC-3.md">AC-3</a></td>
123
+ <td><a href="md/ AC-3.md">AC-3</a></td>
124
124
</tr >
125
125
<tr >
126
126
<td align="center">•</td>
127
127
<td align="center"></td>
128
- <td><a href="Backtracking-Search.md">BACKTRACKING-SEARCH</a></td>
128
+ <td><a href="md/ Backtracking-Search.md">BACKTRACKING-SEARCH</a></td>
129
129
</tr >
130
130
<tr >
131
131
<td align="center">•</td>
132
132
<td align="center"></td>
133
- <td><a href="Min-Conflicts.md">MIN-CONFLICTS</a></td>
133
+ <td><a href="md/ Min-Conflicts.md">MIN-CONFLICTS</a></td>
134
134
</tr >
135
135
<tr >
136
136
<td align="center">•</td>
@@ -151,7 +151,7 @@ The file [aima3e-algorithms.pdf](https://github.com/aimacode/pseudocode/blob/mas
151
151
<tr >
152
152
<td align="center">•</td>
153
153
<td align="center"></td>
154
- <td><a href="Monte-Carlo-Localization.md">MONTE-CARLO-LOCALIZATION</a></td>
154
+ <td><a href="md/ Monte-Carlo-Localization.md">MONTE-CARLO-LOCALIZATION</a></td>
155
155
</tr >
156
156
</tbody >
157
157
</table >
0 commit comments