"The Amazing Clojure"
summary
Clojure code generates and visualizes mazes using Rebel and a small viewer, implementing common algorithms (recursive backtracker, Wilson, hunt-and-kill) and a unicursal space‑filling variant; perfect mazes tend to use only a third of cells for the solution and universal‑maze construction can thrash (an 8x8 sometimes takes ~20 minutes, one lucky run finishes in 11 ms). Solver uses a flood/distance (Dijkstra‑style) pass to extract paths. Tooling notes: clerk, babashka and GraalVM interop exist; code is messy but runnable and maze‑as‑talk idea is abandoned. 2M downloads/month and ~1,200 Clojure developers at NewBank with 1,000+ microservices are highlighted as ecosystem evidence.
AI-written summary · about
chapters (18)
- 0:00Introduction
- 2:47Maze Algorithm
- 9:30Universal Mazes
- 13:25recursive backtracking
- 17:30mazes
- 18:30closure
- 23:53closure work
- 26:49closure makes us happy
- 27:27closure pays
- 27:59closure is stable
- 30:30closure is flexible
- 33:32Clojure community
- 36:19Obstacles
- 38:27Learning Clojure
- 41:13Jobs
- 42:17Learning Materials
- 43:43Why Clojure
- 47:09Roadmap
related talks
28mPanel with Tovieye Ozi and Markus Kloimwieder
36mLearning Clojure and CLJS by playing a card game
34mClojure by neophyte
49mA whirlwind tour of functional programming in Clojure
31mClojure at 4,000 msg/s-What We Learned, Loved, and Loathed
31mScientific Computing with Clojure
38mScientific Clojure, a bird's eye view
27mReal World AI Integration