/**
* Content-Registry-Daten als globale Variable.
*
* Wrapper um config/content-registry.json, damit die Content-Registry
* auch ohne lokalen Server (file://) funktioniert.
*
* WICHTIG: Diese Datei wird automatisch von content-registry.js genutzt,
* wenn kein HTTP-Server verfügbar ist. Bitte bei Änderungen an
* config/content-registry.json synchron halten.
*
* @fileoverview
* @author Alexander Wolf
* @version 1.0
* @global {Object} window.CONTENT_REGISTRY_DATA
* @see config/content-registry.json
* @see docs/specifications/ES_MODULES_CORS_EVALUATION.md §1.3
*/
window.CONTENT_REGISTRY_DATA = {
"version": 1,
"resources": [
{
"id": "game_rotatebox",
"type": "game",
"title": "RotateBox",
"slug": "rotatebox",
"path": "html/games/rotatebox.html",
"description": "Drehe die Box in die richtige Position – entdecke, wie KI Suchbäume nutzt.",
"icon": "🔄",
"difficulty": 1,
"topics": [
"search-trees"
],
"prerequisites": [],
"relatedResources": [
"playground_rotatebox_viz",
"expedition_search_trees"
],
"targetAudience": [
"beginner",
"academic",
"student"
],
"estimatedMinutes": 10,
"glossaryTerms": [
"suchbaum",
"zustandsraum",
"brute-force"
]
},
{
"id": "game_knights_tour",
"type": "game",
"title": "Springerproblem",
"slug": "knights-tour",
"path": "html/games/knights-tour.html",
"description": "Besuche jedes Feld genau einmal – ein klassisches Graphenproblem.",
"icon": "♞",
"difficulty": 2,
"topics": [
"search-trees",
"heuristics"
],
"prerequisites": [],
"relatedResources": [
"playground_knights_tour_viz"
],
"targetAudience": [
"beginner",
"academic",
"student"
],
"estimatedMinutes": 15,
"glossaryTerms": [
"graph",
"heuristik",
"backtracking"
]
},
{
"id": "game_tictactoe",
"type": "game",
"title": "TicTacToe",
"slug": "tictactoe",
"path": "html/games/tictactoe-menu.html",
"description": "Klassisch, 3D oder Ultimate – spiele gegen verschiedene KI-Agenten.",
"icon": "⭕",
"difficulty": 1,
"topics": [
"game-theory",
"heuristics"
],
"prerequisites": [],
"relatedResources": [
"playground_minimax_viz",
"playground_arena",
"playground_nn_ttt",
"expedition_minimax"
],
"targetAudience": [
"beginner",
"academic",
"student"
],
"estimatedMinutes": 10,
"glossaryTerms": [
"minimax",
"agent",
"spielbaum"
],
"variants": [
{
"id": "game_ttt_regular",
"title": "TicTacToe Regular",
"path": "html/games/ttt-regular.html"
},
{
"id": "game_ttt_3d",
"title": "3D TicTacToe",
"path": "html/games/ttt-3d.html"
},
{
"id": "game_ttt_ultimate",
"title": "Ultimate TicTacToe",
"path": "html/games/ttt-ultimate.html"
}
]
},
{
"id": "game_connect4",
"type": "game",
"title": "4 Gewinnt",
"slug": "connect4",
"path": "html/games/connect4-menu.html",
"description": "Klassisch oder 3D – fordere die KI heraus.",
"icon": "🔴",
"difficulty": 2,
"topics": [
"game-theory",
"heuristics"
],
"prerequisites": [],
"relatedResources": [
"playground_arena"
],
"targetAudience": [
"beginner",
"academic",
"student"
],
"estimatedMinutes": 10,
"glossaryTerms": [
"minimax",
"heuristik",
"alpha-beta-pruning"
],
"variants": [
{
"id": "game_connect4_classic",
"title": "4 Gewinnt Klassik",
"path": "html/games/connect4.html"
},
{
"id": "game_connect4_3d",
"title": "4 Gewinnt 3D",
"path": "html/games/connect4-3d.html"
}
]
},
{
"id": "playground_rotatebox_viz",
"type": "playground",
"title": "Suchbaum-Visualisierung",
"slug": "rotatebox-viz",
"path": "html/playground/rotatebox-viz.html",
"description": "BFS- und DFS-Suchbäume live generieren und explorieren.",
"icon": "🌳",
"difficulty": 2,
"topics": [
"search-trees"
],
"prerequisites": [],
"relatedResources": [
"game_rotatebox",
"expedition_search_trees"
],
"targetAudience": [
"academic",
"student"
],
"estimatedMinutes": 15,
"glossaryTerms": [
"suchbaum",
"breitensuche",
"tiefensuche",
"knoten",
"kante"
]
},
{
"id": "playground_knights_tour_viz",
"type": "playground",
"title": "Springer-Visualisierung",
"slug": "knights-tour-viz",
"path": "html/playground/knights-tour-viz.html",
"description": "Beobachte, wie der Springer-Algorithmus das Schachbrett durchsucht.",
"icon": "🗺️",
"difficulty": 2,
"topics": [
"search-trees",
"heuristics"
],
"prerequisites": [],
"relatedResources": [
"game_knights_tour"
],
"targetAudience": [
"academic",
"student"
],
"estimatedMinutes": 10,
"glossaryTerms": [
"backtracking",
"heuristik",
"graph"
]
},
{
"id": "playground_minimax_viz",
"type": "playground",
"title": "Minimax-Visualisierung",
"slug": "minimax-viz",
"path": "html/playground/minimax-viz.html",
"description": "Schau der KI beim Denken zu – Minimax-Algorithmus Schritt für Schritt.",
"icon": "🧠",
"difficulty": 3,
"topics": [
"game-theory"
],
"prerequisites": [],
"relatedResources": [
"game_tictactoe",
"expedition_minimax"
],
"targetAudience": [
"academic",
"student"
],
"estimatedMinutes": 20,
"glossaryTerms": [
"minimax",
"spielbaum",
"bewertungsfunktion",
"alpha-beta-pruning"
]
},
{
"id": "playground_rules_lab",
"type": "playground",
"title": "Regel-Labor",
"slug": "rules-lab",
"path": "html/playground/rules-lab.html",
"description": "Erstelle eigene Spielregeln und teste, wie die KI darauf reagiert.",
"icon": "⚗️",
"difficulty": 3,
"topics": [
"rule-systems",
"game-theory"
],
"prerequisites": [],
"relatedResources": [
"game_tictactoe",
"game_connect4"
],
"targetAudience": [
"academic",
"student"
],
"estimatedMinutes": 20,
"glossaryTerms": [
"regelsystem",
"entscheidungsbaum"
]
},
{
"id": "playground_arena",
"type": "playground",
"title": "Arena",
"slug": "arena",
"path": "html/playground/arena.html",
"description": "Lass verschiedene KI-Agenten gegeneinander antreten.",
"icon": "⚔️",
"difficulty": 2,
"topics": [
"game-theory",
"heuristics"
],
"prerequisites": [],
"relatedResources": [
"game_tictactoe",
"game_connect4"
],
"targetAudience": [
"beginner",
"academic",
"student"
],
"estimatedMinutes": 15,
"glossaryTerms": [
"agent",
"benchmark",
"heuristik"
]
},
{
"id": "playground_perceptron",
"type": "playground",
"title": "Perzeptron-Playground",
"slug": "perceptron-playground",
"path": "html/playground/perceptron-playground.html",
"description": "Trainiere ein neuronales Netz live im Browser.",
"icon": "🔮",
"difficulty": 3,
"topics": [
"neural-networks",
"math-foundations"
],
"prerequisites": [],
"relatedResources": [
"playground_nn_ttt"
],
"targetAudience": [
"academic",
"student"
],
"estimatedMinutes": 25,
"glossaryTerms": [
"perceptron",
"neuronale-netze",
"aktivierungsfunktion",
"lernrate",
"gradient"
]
},
{
"id": "playground_nn_ttt",
"type": "playground",
"title": "NN-Playground: TicTacToe",
"slug": "nn-playground",
"path": "html/playground/nn-playground.html",
"description": "Trainiere ein mehrschichtiges neuronales Netz, TicTacToe zu spielen – beobachte den Datenfluss live.",
"icon": "🧬",
"difficulty": 3,
"topics": [
"neural-networks",
"game-theory"
],
"prerequisites": [
"playground_perceptron"
],
"relatedResources": [
"playground_perceptron",
"game_tictactoe",
"playground_arena"
],
"targetAudience": [
"academic",
"student"
],
"estimatedMinutes": 30,
"glossaryTerms": [
"neuronale-netze",
"hidden-layer",
"softmax",
"supervised-learning",
"backpropagation",
"forward-pass",
"topologie",
"overfitting",
"epoche",
"aktivierungsfunktion",
"verlustfunktion",
"lernrate"
]
},
{
"id": "playground_tree_viz_v2",
"type": "playground",
"hidden": true,
"title": "Tree Visualization v2",
"slug": "tree-viz-v2",
"path": "html/playground/tree-viz-v2.html",
"description": "Erweiterte Suchbaum-Visualisierung mit modularer Engine.",
"icon": "🌲",
"difficulty": 3,
"topics": [
"search-trees"
],
"prerequisites": [],
"relatedResources": [
"playground_rotatebox_viz"
],
"targetAudience": [
"academic",
"student"
],
"estimatedMinutes": 15,
"glossaryTerms": [
"suchbaum",
"knoten",
"kante"
]
},
{
"id": "expedition_search_trees",
"type": "expedition",
"title": "Suchbäume — Wie denkt ein Computer?",
"slug": "expedition-searchtrees",
"path": "html/learning-paths/expedition-searchtrees/00_intro.html",
"description": "10 Kapitel – Erlebe, wie Computer komplexe Rätsel lösen.",
"icon": "🌲",
"difficulty": 2,
"topics": [
"search-trees",
"complexity"
],
"prerequisites": [],
"relatedResources": [
"game_rotatebox",
"playground_rotatebox_viz"
],
"targetAudience": [
"academic",
"student"
],
"estimatedMinutes": 45,
"glossaryTerms": [
"suchbaum",
"breitensuche",
"tiefensuche",
"brute-force",
"exponentiell",
"duplikat"
],
"chapters": [
{ "id": "est_00", "title": "Überblick", "path": "html/learning-paths/expedition-searchtrees/00_intro.html" },
{ "id": "est_01", "title": "Kannst du das Rätsel lösen?", "path": "html/learning-paths/expedition-searchtrees/01_hook.html" },
{ "id": "est_02", "title": "Die Maschine übernimmt", "path": "html/learning-paths/expedition-searchtrees/02_demo.html" },
{ "id": "est_03", "title": "Wie würdest DU das lösen?", "path": "html/learning-paths/expedition-searchtrees/03_frage.html" },
{ "id": "est_04", "title": "Was ist ein Suchbaum?", "path": "html/learning-paths/expedition-searchtrees/04_suchbaum.html" },
{ "id": "est_05", "title": "Der Baum wächst", "path": "html/learning-paths/expedition-searchtrees/05_wachstum.html" },
{ "id": "est_06", "title": "Das Wachstum berechnen", "path": "html/learning-paths/expedition-searchtrees/06_komplexitaet.html" },
{ "id": "est_07", "title": "Der kürzeste Weg", "path": "html/learning-paths/expedition-searchtrees/07_bfs.html" },
{ "id": "est_08", "title": "Doppelgänger erkennen", "path": "html/learning-paths/expedition-searchtrees/08_duplikate.html" },
{ "id": "est_09", "title": "Grenzen der Berechnung", "path": "html/learning-paths/expedition-searchtrees/09_grenzen.html" },
{ "id": "est_10", "title": "Abschlussquiz", "path": "html/learning-paths/expedition-searchtrees/10_quiz.html" }
]
},
{
"id": "expedition_minimax",
"type": "expedition",
"title": "Minimax — Wie denkt eine Spiele-KI?",
"slug": "expedition-minimax",
"path": "html/learning-paths/expedition-minimax/00_intro.html",
"description": "27 Kapitel – Vom Tic-Tac-Toe bis zur Komplexitätsexplosion.",
"icon": "🧠",
"difficulty": 3,
"topics": [
"game-theory",
"heuristics",
"complexity"
],
"prerequisites": [
"expedition_search_trees"
],
"relatedResources": [
"game_tictactoe",
"playground_minimax_viz"
],
"targetAudience": [
"academic",
"student"
],
"estimatedMinutes": 60,
"glossaryTerms": [
"minimax",
"spielbaum",
"bewertungsfunktion",
"alpha-beta-pruning",
"heuristik",
"pruning"
],
"chapters": [
{ "id": "emx_00", "title": "Überblick", "path": "html/learning-paths/expedition-minimax/00_intro.html" },
{ "id": "emx_01", "title": "Kannst du die KI schlagen?", "path": "html/learning-paths/expedition-minimax/01_hook.html" },
{ "id": "emx_02", "title": "Wie entscheidet die KI?", "path": "html/learning-paths/expedition-minimax/02_frage.html" },
{ "id": "emx_03", "title": "Kein Zufall — pure Berechnung", "path": "html/learning-paths/expedition-minimax/03_staunen.html" },
{ "id": "emx_04", "title": "Spielpositionen als Zahlen", "path": "html/learning-paths/expedition-minimax/04_bewertung.html" },
{ "id": "emx_05", "title": "Positionen bewerten üben", "path": "html/learning-paths/expedition-minimax/05_bewertung_quiz.html" },
{ "id": "emx_06", "title": "Aus wessen Sicht?", "path": "html/learning-paths/expedition-minimax/06_max_perspektive.html" },
{ "id": "emx_07", "title": "Zwei Spieler, zwei Ziele", "path": "html/learning-paths/expedition-minimax/07_zwei_spieler.html" },
{ "id": "emx_08", "title": "Das Minimax-Prinzip", "path": "html/learning-paths/expedition-minimax/08_minmax_prinzip.html" },
{ "id": "emx_09", "title": "Von Blättern zur Wurzel", "path": "html/learning-paths/expedition-minimax/09_propagation.html" },
{ "id": "emx_10", "title": "Nicht nur Tic-Tac-Toe!", "path": "html/learning-paths/expedition-minimax/10_generisch.html" },
{ "id": "emx_11", "title": "Der Minimax-Baukasten", "path": "html/learning-paths/expedition-minimax/11_viz_einfuehrung.html" },
{ "id": "emx_12", "title": "Blätter auswerten", "path": "html/learning-paths/expedition-minimax/12_viz_blaetter.html" },
{ "id": "emx_13", "title": "Innere Knoten: MAX und MIN", "path": "html/learning-paths/expedition-minimax/13_viz_innere.html" },
{ "id": "emx_14", "title": "Ein größerer Baum", "path": "html/learning-paths/expedition-minimax/14_viz_komplex.html" },
{ "id": "emx_15", "title": "Minimax trifft Tic-Tac-Toe", "path": "html/learning-paths/expedition-minimax/15_ttt_baum.html" },
{ "id": "emx_16", "title": "Das perfekte Spiel", "path": "html/learning-paths/expedition-minimax/16_ttt_erkenntnis.html" },
{ "id": "emx_17", "title": "Selbst bewerten: Fast fertig!", "path": "html/learning-paths/expedition-minimax/17_ttt_aufgabe.html" },
{ "id": "emx_18", "title": "Wie viele Möglichkeiten?", "path": "html/learning-paths/expedition-minimax/18_komplexitaet_ttt.html" },
{ "id": "emx_19", "title": "Ultimate Tic-Tac-Toe", "path": "html/learning-paths/expedition-minimax/19_ultimate_ttt.html" },
{ "id": "emx_20", "title": "Die Zahlen-Explosion", "path": "html/learning-paths/expedition-minimax/20_explosion.html" },
{ "id": "emx_21", "title": "Brute Force am Limit", "path": "html/learning-paths/expedition-minimax/21_problem.html" },
{ "id": "emx_22", "title": "Nicht bis zum Ende schauen", "path": "html/learning-paths/expedition-minimax/22_suchtiefe.html" },
{ "id": "emx_23", "title": "Schätzen statt Rechnen", "path": "html/learning-paths/expedition-minimax/23_heuristik.html" },
{ "id": "emx_24", "title": "Qualität der Heuristik", "path": "html/learning-paths/expedition-minimax/24_heuristik_varianten.html" },
{ "id": "emx_25", "title": "Von TTT zur Welt der Spiele-KI", "path": "html/learning-paths/expedition-minimax/25_transfer.html" },
{ "id": "emx_26", "title": "5 Schlüssel-Erkenntnisse", "path": "html/learning-paths/expedition-minimax/26_zusammenfassung.html" },
{ "id": "emx_27", "title": "Abschlussquiz", "path": "html/learning-paths/expedition-minimax/27_quiz.html" }
]
},
{
"id": "challenge_galaxy_search_trees",
"type": "challenge-galaxy",
"title": "Suchbaum-Missionen",
"slug": "search-trees-challenges",
"path": "html/universe-map.html#galaxy_search_trees",
"description": "13 Missionen rund um Brute-Force, Duplikate, Formeln und mehr.",
"icon": "💥",
"difficulty": 2,
"topics": [
"search-trees",
"complexity"
],
"prerequisites": [],
"relatedResources": [
"game_rotatebox",
"expedition_search_trees",
"playground_rotatebox_viz"
],
"targetAudience": [
"beginner",
"academic",
"student"
],
"estimatedMinutes": 60,
"glossaryTerms": [
"suchbaum",
"brute-force",
"exponentiell",
"duplikat"
],
"missions": [
{
"id": "c01_bruteforce",
"title": "Der blinde Passagier",
"path": "html/challenges/search-trees/c01_bruteforce.html"
},
{
"id": "c02_puzzle",
"title": "Der perfekte Weg",
"path": "html/challenges/search-trees/c02_puzzle.html"
},
{
"id": "c03_ai_awakes",
"title": "Die Maschine erwacht",
"path": "html/challenges/search-trees/c03_ai_awakes.html"
},
{
"id": "c04_multiverse",
"title": "Das Multiversum",
"path": "html/challenges/search-trees/c04_multiverse.html"
},
{
"id": "c04b_duplicates",
"title": "Die Doppelgänger",
"path": "html/challenges/search-trees/c04b_duplicates.html"
},
{
"id": "c05_chain_reaction",
"title": "Die Kettenreaktion",
"path": "html/challenges/search-trees/c05_chain_reaction.html"
},
{
"id": "c06a_math_hook",
"title": "Das Reiskorn-Rätsel",
"path": "html/challenges/search-trees/c06a_math_hook.html"
},
{
"id": "c06b_speed",
"title": "Schneller als das Licht",
"path": "html/challenges/search-trees/c06b_speed.html"
},
{
"id": "c06c_loop",
"title": "Die Endlosschleife",
"path": "html/challenges/search-trees/c06c_loop.html"
},
{
"id": "c07a_formula",
"title": "Die Formel des Untergangs",
"path": "html/challenges/search-trees/c07a_formula.html"
},
{
"id": "c07b_universe",
"title": "Die Grenzen der Zeit",
"path": "html/challenges/search-trees/c07b_universe.html"
},
{
"id": "c07c_filter",
"title": "Das perfekte Gedächtnis",
"path": "html/challenges/search-trees/c07c_filter.html"
},
{
"id": "c08_boss_quiz",
"title": "Der Meister des Baumes",
"path": "html/challenges/search-trees/c08_boss_quiz.html"
}
]
}
]
};