challenges.json

[
  {
    "title": "Automata Studio",
    "tag": "Theory \u00b7 Simulation",
    "date": "Apr 2026",
    "desc": "Build and simulate DFAs, NFAs, GNFAs, PDAs, Turing Machines, and CFGs in the browser. Convert between representations \u2014 NFA\u2192DFA, DFA minimisation, GNFA\u2192regex, regex\u2192NFA, and CFG\u2192CNF \u2014 with step-by-step visualisation and LaTeX export.",
    "chips": ["COMP4141", "finite automata", "pushdown automata", "Turing machines", "formal languages"],
    "href": "./automata-studio/index.html",
    "featured": true,
    "directlyFeatured": false
  },
  {
    "title": "Turing Machine Simulator",
    "tag": "Theory \u00b7 1D \u00b7 2D",
    "date": "Apr 2026",
    "desc": "Write transition rules in a plain-text format, load a tape, and step through the universal model of computation. Includes a 2D mode whose star feature is a 2D\u21921D compiler: any 2D Turing program is mechanically rewritten into an equivalent 1D program that lays each row out between separators and shuffles head markers around \u2014 a constructive proof that the extra dimension buys you no extra power.",
    "chips": ["computability theory", "2D\u21921D compiler", "transition rules", "tape automata", "Game of Life", "test suite"],
    "links": [
      { "label": "1D", "href": "./turing-simulation/index.html" },
      { "label": "2D", "href": "./turing-simulation/2d/index.html" }
    ],
    "featured": true,
    "directlyFeatured": true
  },
  {
    "title": "Game of Life",
    "tag": "Simulation \u00b7 Cellular Automata",
    "date": "Apr 2026",
    "desc": "Conway\u2019s classic cellular automaton on a configurable grid. Draw patterns, run generations, and export the board state directly into the 2D Turing Machine simulator.",
    "chips": ["cellular automata", "Conway 1970", "canvas", "TM export"],
    "href": "./game-of-life/index.html",
    "featured": true
  },
  {
    "title": "Typing Tester PEG Grammar",
    "tag": "Tool \u00b7 Typing",
    "date": "Apr 2026",
    "desc": "Practise typing Python at speed. A weighted PEG-grammar generator builds plausible Python snippets \u2014 assignments, if/else, for loops, function and class definitions \u2014 and you race against either a time limit or a word limit. Live WPM and accuracy, easy/normal/hard difficulty, and results saved in local storage with a progress-over-time chart.",
    "chips": ["PEG grammar", "weighted generation", "WPM", "localStorage", "canvas chart"],
    "href": "./python-typing-tester/index.html",
    "featured": true
  },
  {
    "title": "Boids",
    "tag": "Simulation",
    "date": "May 2024",
    "desc": "Craig Reynolds\u2019 classic emergent flocking algorithm from 1987. Three local forces \u2014 separation, alignment, cohesion \u2014 produce complex collective motion from zero central coordination.",
    "chips": ["emergent behaviour", "swarm intelligence", "Reynolds 1987", "canvas"],
    "href": "./boids/index.html",
    "featured": true
  },
  {
    "title": "Tic Tac Toe",
    "tag": "Game \u00b7 AI \u00b7 2P",
    "date": "Apr 2022",
    "desc": "Four variants on the classic 3\u00d73 grid \u2014 a perfect minimax AI, an easy one-ply opponent, a handicapped baby-mode, and a local two-player mode. Pick your difficulty.",
    "chips": ["minimax", "adversarial search", "difficulty scaling", "local multiplayer"],
    "href": "./tic-tac-toe/index.html",
    "featured": false
  }
]