Hugo: enable search (#310)

* Hugo: enable search * rename folder 'search' into 'searching' to avoid name clash with search functionality
Artificial-Intelligence-HSBI-TDU · Oct 6, 2023 · 73bacaf · 73bacaf
1 parent 315f0f1
commit 73bacaf
Show file tree

Hide file tree

Showing 25 changed files with 45 additions and 44 deletions.
diff --git a/hugo_conf.yaml b/hugo_conf.yaml
@@ -23,7 +23,8 @@ params:
   disableBreadcrumb: true
   disableInlineCopyToClipBoard: true
   disableNextPrev: true
-  disableSearch: true
+  disableSearch: false
+  disableSearchHiddenPages: false
   disableLandingPageButton: true
   disableLanguageSwitchingButton: true
   disableMathJax: false
@@ -32,9 +33,9 @@ params:
     - "auto"
     - "zen-light"
     - "zen-dark"
+    - "relearn-bright"
     - "relearn-light"
     - "relearn-dark"
-    - "green"
 
 menu:
   shortcuts:
@@ -58,6 +59,8 @@ outputs:
   home:
     - HTML
     - PRINT
+    - SEARCH
+    - SEARCHPAGE
   section:
     - HTML
     - PRINT

diff --git a/lecture/search/informed/astar.md → lecture/searching/informed/astar.md b/lecture/search/informed/astar.md → lecture/searching/informed/astar.md
diff --git a/lecture/search/informed/bestfirst.md → lecture/searching/informed/bestfirst.md b/lecture/search/informed/bestfirst.md → lecture/searching/informed/bestfirst.md
diff --git a/lecture/search/informed/branchandbound.md → lecture/searching/informed/branchandbound.md b/lecture/search/informed/branchandbound.md → lecture/searching/informed/branchandbound.md
diff --git a/lecture/search/informed/images/challenge.png → ...e/searching/informed/images/challenge.png b/lecture/search/informed/images/challenge.png → ...e/searching/informed/images/challenge.png
diff --git a/...arch/informed/images/challenges_robby.png → ...hing/informed/images/challenges_robby.png b/...arch/informed/images/challenges_robby.png → ...hing/informed/images/challenges_robby.png
diff --git a/lecture/search/informed/images/graph.png → lecture/searching/informed/images/graph.png b/lecture/search/informed/images/graph.png → lecture/searching/informed/images/graph.png
diff --git a/.../search/informed/images/tafelbeispiel.png → ...arching/informed/images/tafelbeispiel.png b/.../search/informed/images/tafelbeispiel.png → ...arching/informed/images/tafelbeispiel.png
diff --git a/lecture/search/informed/readme.md → lecture/searching/informed/readme.md b/lecture/search/informed/readme.md → lecture/searching/informed/readme.md
diff --git a/lecture/search/local/annealing.md → lecture/searching/local/annealing.md b/lecture/search/local/annealing.md → lecture/searching/local/annealing.md
diff --git a/lecture/search/local/gradient.md → lecture/searching/local/gradient.md b/lecture/search/local/gradient.md → lecture/searching/local/gradient.md
diff --git a/lecture/search/local/images/challenge.png → lecture/searching/local/images/challenge.png b/lecture/search/local/images/challenge.png → lecture/searching/local/images/challenge.png
diff --git a/lecture/search/local/images/graph.png → lecture/searching/local/images/graph.png b/lecture/search/local/images/graph.png → lecture/searching/local/images/graph.png
diff --git a/...ure/search/local/images/hill-climbing.png → .../searching/local/images/hill-climbing.png b/...ure/search/local/images/hill-climbing.png → .../searching/local/images/hill-climbing.png
diff --git a/...h/local/images/screenshot_stundenplan.png → ...g/local/images/screenshot_stundenplan.png b/...h/local/images/screenshot_stundenplan.png → ...g/local/images/screenshot_stundenplan.png
diff --git a/...ure/search/local/images/tafelbeispiel.png → .../searching/local/images/tafelbeispiel.png b/...ure/search/local/images/tafelbeispiel.png → .../searching/local/images/tafelbeispiel.png
diff --git a/lecture/search/local/readme.md → lecture/searching/local/readme.md b/lecture/search/local/readme.md → lecture/searching/local/readme.md
diff --git a/lecture/search/readme.md → lecture/searching/readme.md b/lecture/search/readme.md → lecture/searching/readme.md
diff --git a/lecture/search/uninformed/bfs.md → lecture/searching/uninformed/bfs.md b/lecture/search/uninformed/bfs.md → lecture/searching/uninformed/bfs.md
diff --git a/lecture/search/uninformed/dfs.md → lecture/searching/uninformed/dfs.md b/lecture/search/uninformed/dfs.md → lecture/searching/uninformed/dfs.md
diff --git a/lecture/search/uninformed/images/graph.png → ...ure/searching/uninformed/images/graph.png b/lecture/search/uninformed/images/graph.png → ...ure/searching/uninformed/images/graph.png
diff --git a/lecture/search/uninformed/images/scene.png → ...ure/searching/uninformed/images/scene.png b/lecture/search/uninformed/images/scene.png → ...ure/searching/uninformed/images/scene.png
diff --git a/...earch/uninformed/images/tafelbeispiel.png → ...ching/uninformed/images/tafelbeispiel.png b/...earch/uninformed/images/tafelbeispiel.png → ...ching/uninformed/images/tafelbeispiel.png
diff --git a/lecture/search/uninformed/readme.md → lecture/searching/uninformed/readme.md b/lecture/search/uninformed/readme.md → lecture/searching/uninformed/readme.md
diff --git a/readme.md b/readme.md
@@ -137,13 +137,11 @@ Prüfungsform HSBI: **Klausur plus Testat**, 5 ECTS
 :::
 ::: {.tab title="TDU"}
 
-
-| Prüfung         | Gewicht                          |
-|:----------------|----------------------------------|
-| Zwischenprüfung | **40 %**                         |
-| Endprüfung      | **60 %**                         |
-| Übung           | **10 % Bonus für Endprüfung**    |
-
+| Prüfung         | Gewicht                       |
+|:----------------|-------------------------------|
+| Zwischenprüfung | **40 %**                      |
+| Endprüfung      | **60 %**                      |
+| Übung           | **10 % Bonus für Endprüfung** |
 
 Wenn in der Endprüfung die 40 Punkte Mindestgrenze erreicht wird (**Prüfungsnote ≥40**),
 werden **10 % der Übungspunkte als Bonus** zu der Prüfungsnote hinzugefügt.
@@ -207,36 +205,36 @@ Für die Vergabe von Übungspunkten ist eine **erfolgreiche Teilnahme an der Üb
 :::
 ::: {.tab title="TDU"}
 
-| Woche | Datum Vorlesung      | Themen                                                                                                        | Lead           | Start Bearbeitung |
-|:-----:|:---------------------|:--------------------------------------------------------------------------------------------------------------|:---------------|:------------------|
-|  40   | Mo, 02.10.           | Orga TDU (**Zoom**) \|\| [Einführung KI] \| [Problemlösen]                                                    | Canan, Carsten |                   |
-|  41   | Mo, 09.10.           | [Machine Learning 101] \| [CAL2] \| [Pruning] \| [CAL3] \| [Entropie] \| [ID3 und C4.5]                       | Carsten        | [B05]             |
-|  42   | Mo, 16.10.           | [Tiefensuche] \| [Breitensuche] \| [Branch-and-Bound] \| [Best First] \| [A-Stern]                            | Carsten        | [B01]             |
-|  43   | Mo, 23.10.           | [Gradientensuche] \| [Simulated Annealing] \|\| [Intro EA/GA] \| [Genetische Algorithmen]                     | Carsten        | [B02]             |
-|  44   | Mo, 30.10.           | [Optimale Spiele] \| [Minimax] \| [Minimax und Heuristiken] \| [Alpha-Beta-Pruning]                           | Carsten        | [B03]             |
-|  45   | Mo, 06.11.           | [Einführung Constraints] \| [Lösen von diskreten CSP] \| [CSP und Heuristiken] \| [Kantenkonsistenz und AC-3] | Carsten        | [B04]             |
-|  46   | Mo, 13.11.           | [Wahrscheinlichkeitstheorie] \| [Naive Bayes]                                                                 | Carsten        | [B06]             |
-|  47   | Mo, 20.11.           | **Zwischenprüfung**                                                                                           |                |                   |
-|  48   | Mo, 27.11.           | [Perzeptron]                                                                                                  | Canan          | [B07]             |
-|  49   | Mo, 04.12.           | [Lineare Regression]                                                                                          | Canan          | [B08]             |
-|  50   | Mo, 11.12.           | [Logistische Regression]                                                                                      | Canan          |                   |
-|  51   | Mo, 18.12.           | [Overfitting] \| [Multilayer Perceptron]                                                                      | Canan          | [B09]             |
-|  52   | Mo, 25.12.           | [Backpropagation]                                                                                             | Canan          | [B10]             |
-|  02   | Mo, 08.01.           | [Training & Testing] \| [Performanzanalyse] \|\| [Prüfungsvorbereitung TDU]                                   | Canan          |                   |
+| Woche | Datum Vorlesung | Themen                                                                                                        | Lead           | Start Bearbeitung |
+|:-----:|:----------------|:--------------------------------------------------------------------------------------------------------------|:---------------|:------------------|
+|  40   | Mo, 02.10.      | Orga TDU (**Zoom**) \|\| [Einführung KI] \| [Problemlösen]                                                    | Canan, Carsten |                   |
+|  41   | Mo, 09.10.      | [Machine Learning 101] \| [CAL2] \| [Pruning] \| [CAL3] \| [Entropie] \| [ID3 und C4.5]                       | Carsten        | [B05]             |
+|  42   | Mo, 16.10.      | [Tiefensuche] \| [Breitensuche] \| [Branch-and-Bound] \| [Best First] \| [A-Stern]                            | Carsten        | [B01]             |
+|  43   | Mo, 23.10.      | [Gradientensuche] \| [Simulated Annealing] \|\| [Intro EA/GA] \| [Genetische Algorithmen]                     | Carsten        | [B02]             |
+|  44   | Mo, 30.10.      | [Optimale Spiele] \| [Minimax] \| [Minimax und Heuristiken] \| [Alpha-Beta-Pruning]                           | Carsten        | [B03]             |
+|  45   | Mo, 06.11.      | [Einführung Constraints] \| [Lösen von diskreten CSP] \| [CSP und Heuristiken] \| [Kantenkonsistenz und AC-3] | Carsten        | [B04]             |
+|  46   | Mo, 13.11.      | [Wahrscheinlichkeitstheorie] \| [Naive Bayes]                                                                 | Carsten        | [B06]             |
+|  47   | Mo, 20.11.      | **Zwischenprüfung**                                                                                           |                |                   |
+|  48   | Mo, 27.11.      | [Perzeptron]                                                                                                  | Canan          | [B07]             |
+|  49   | Mo, 04.12.      | [Lineare Regression]                                                                                          | Canan          | [B08]             |
+|  50   | Mo, 11.12.      | [Logistische Regression]                                                                                      | Canan          |                   |
+|  51   | Mo, 18.12.      | [Overfitting] \| [Multilayer Perceptron]                                                                      | Canan          | [B09]             |
+|  52   | Mo, 25.12.      | [Backpropagation]                                                                                             | Canan          | [B10]             |
+|  02   | Mo, 08.01.      | [Training & Testing] \| [Performanzanalyse] \|\| [Prüfungsvorbereitung TDU]                                   | Canan          |                   |
 
 :::
 ::::::
 
 [Einführung KI]: lecture/intro/intro-ai.md
 [Problemlösen]: lecture/intro/problems.md
 
-[Tiefensuche]: lecture/search/uninformed/dfs.md
-[Breitensuche]: lecture/search/uninformed/bfs.md
-[Branch-and-Bound]: lecture/search/informed/branchandbound.md
-[Best First]: lecture/search/informed/bestfirst.md
-[A-Stern]: lecture//search/informed/astar.md
-[Gradientensuche]: lecture/search/local/gradient.md
-[Simulated Annealing]: lecture/search/local/annealing.md
+[Tiefensuche]: lecture/searching/uninformed/dfs.md
+[Breitensuche]: lecture/searching/uninformed/bfs.md
+[Branch-and-Bound]: lecture/searching/informed/branchandbound.md
+[Best First]: lecture/searching/informed/bestfirst.md
+[A-Stern]: lecture//searching/informed/astar.md
+[Gradientensuche]: lecture/searching/local/gradient.md
+[Simulated Annealing]: lecture/searching/local/annealing.md
 
 [Intro EA/GA]: lecture/ea/intro-ea.md
 [Genetische Algorithmen]: lecture/ea/ga.md
@@ -300,18 +298,18 @@ Für die Vergabe von Übungspunkten ist eine **erfolgreiche Teilnahme an der Üb
 :::
 ::: {.tab title="TDU"}
 
-| Woche | Blatt                  |  Vorstellung Übung  |
-|:-----:|:-----------------------|:--------------------|
-|  42   | [B05]: DTL             |  Do, 19.10.         |
-|  43   | [B01]: Suche           |  Do, 26.10.         |
-|  44   | [B02]: EA/GA           |  Do, 02.11.         |
-|  45   | [B03]: Minimax         |  Do, 09.11.         |
-|  46   | [B04]: CSP             |  Do, 16.11.         |
-|  48   | [B06]: NB              |  Do, 30.11.         |
-|  49   | [B07]: Perzeptron      |  Do, 07.12.         |
-|  51   | [B08]: Lin./Log. Regr. |  Do, 21.12.         |
-|  52   | [B09]: MLP             |  Do, 28.12.         |
-|  02   | [B10]: Backpropagation |  Do, 11.01.         |
+| Woche | Blatt                  | Vorstellung Übung |
+|:-----:|:-----------------------|:------------------|
+|  42   | [B05]: DTL             | Do, 19.10.        |
+|  43   | [B01]: Suche           | Do, 26.10.        |
+|  44   | [B02]: EA/GA           | Do, 02.11.        |
+|  45   | [B03]: Minimax         | Do, 09.11.        |
+|  46   | [B04]: CSP             | Do, 16.11.        |
+|  48   | [B06]: NB              | Do, 30.11.        |
+|  49   | [B07]: Perzeptron      | Do, 07.12.        |
+|  51   | [B08]: Lin./Log. Regr. | Do, 21.12.        |
+|  52   | [B09]: MLP             | Do, 28.12.        |
+|  02   | [B10]: Backpropagation | Do, 11.01.        |
 
 :::
 ::::::