Being Creative with Genetic Algorithms and Typeclasses
summary
Implements a reusable genetic algorithm in Scala where the core iteration never changes and only a genetic typeclass converting chromosome to domain plus a fitness function differ; testing uses ScalaCheck property-based tests and deterministic injection of RNG via unit->double/nextInt/nextBool. Shows numeric optimization with population 30 over 1,000 iterations and a photo-fit run encoding 50 triangles ≈4,000 bits that converges slowly (5,700 iterations, multi-day run) and works but is computationally heavy.
AI-written summary · about
chapters (5)
- 0:00Introduction and agenda
- 2:11Understanding type classes
- 15:41Genetic algorithm basics
- 32:30Practical implementation
- 39:54Wrap up and Q&A
related talks
48mTight Genes: Intro to Genetic Algorithms
46mTight Genes: Intro to Genetic Algorithms
24mGenetic Algorithms in Go
46mTight Genes: Intro to Genetic Algorithms
57mSolutions That Evolve: Building Self-Improving Systems with Genetic Algorithms
24mLet the Scala compiler work for you
35mCellular Automata How to become an artist with a few lines
40mGenetic Programming in Clojure