9.3: Genetic Algorithm: Shakespeare Monkey Example - The Nature of Code

Channel:
United States The Coding Train
Subscribers:
1,740,000
Published on ● Video Link: https://www.youtube.com/watch?v=nrKjSeoc7fc


Duration: 7:47
114,998 views
2,044

Part 3 of the Genetic Algorithm series is dedicated to the Shakespeare Monkey Example. In this video, I use the evolutionary concepts from the previous video to compute a problem that a brute force algorithm wouldn't be able to solve. https://thecodingtrain.com/more/archive/nature-of-code/9-genetic-algorithms/9.3-shakespeare-monkey-example.html

πŸ•ΉοΈ p5.js Web Editor Sketch: https://editor.p5js.org/codingtrain/sketches/GUZKUFxKo

πŸŽ₯ Previous video: https://youtu.be/RxTfc4JLYKs?list=RxTfc4JLYKs&list=PLRqwX-V7Uu6bJM3VgzjNV5YxVxUwzALHV
πŸŽ₯ Next video: https://youtu.be/-jv3CgDN9sc?list=RxTfc4JLYKs&list=PLRqwX-V7Uu6bJM3VgzjNV5YxVxUwzALHV
πŸŽ₯ All videos: https://www.youtube.com/playlist?list=RxTfc4JLYKs&list=PLRqwX-V7Uu6bJM3VgzjNV5YxVxUwzALHV

Links discussed in this video:
πŸ”— Nature of Code Book: https://natureofcode.com/
πŸ”— Shakespeare Monkey Theorem: https://en.wikipedia.org/wiki/Infinite_monkey_theorem

Timestamps:
0:00 Hello!
0:53 Exploring the interface of this sketch.
2:16 How about unicorn?
2:42 Let's change the mutation rate to be 0.
3:28 What play around with the population?
6:36 Is a larger mutation rate better?
7:24 What's next?

πŸš‚ Website: http://thecodingtrain.com/
πŸ‘Ύ Share Your Creation! https://thecodingtrain.com/Guides/community-contribution-guide.html
🚩 Suggest Topics: https://github.com/CodingTrain/Rainbow-Topics
πŸ’‘ GitHub: https://github.com/CodingTrain
πŸ’¬ Discord: https://discord.gg/hPuGy2g
πŸ’– Membership: http://youtube.com/thecodingtrain/join
πŸ›’ Store: https://standard.tv/codingtrain
πŸ“š Books: https://www.amazon.com/shop/thecodingtrain
πŸ–‹οΈ Twitter: https://twitter.com/thecodingtrain
πŸ“Έ Instagram: https://www.instagram.com/the.coding.train/

πŸŽ₯ Coding Challenges: https://www.youtube.com/playlist?list=PLRqwX-V7Uu6ZiZxtDDRCi6uhfTH4FilpH
πŸŽ₯ Intro to Programming: https://www.youtube.com/playlist?list=PLRqwX-V7Uu6Zy51Q-x9tMWIv9cueOFTFA

πŸ”— p5.js: https://p5js.org
πŸ”— p5.js Web Editor: https://editor.p5js.org/
πŸ”— Processing: https://processing.org

πŸ“„ Code of Conduct: https://github.com/CodingTrain/Code-of-Conduct



Other Videos By The Coding Train


2016-08-05Live Stream #56: Poisson Disc Sampling and Diffusion-Limited Aggregation
2016-08-059.6: Genetic Algorithm: Improved Fitness Function - The Nature of Code
2016-08-059.7: Genetic Algorithm: Pool Selection - The Nature of Code
2016-08-04Live Stream #55 - Flappy Bird and Agar.io Clones
2016-08-03Coding Challenge #30: Phyllotaxis
2016-08-039.16: CodePen in p5.js - p5.js Tutorial
2016-08-02Coding Challenge #29: Smart Rockets in p5.js
2016-08-019.5: Genetic Algorithm: Fitness, Genotype vs Phenotype - The Nature of Code
2016-07-31Live Stream #53 - Smart Rockets, CodePen and Arguments Array in JS
2016-07-319.4: Genetic Algorithm: Looking at Code - The Nature of Code
2016-07-309.3: Genetic Algorithm: Shakespeare Monkey Example - The Nature of Code
2016-07-299.2: Genetic Algorithm: How it works - The Nature of Code
2016-07-299.1: Genetic Algorithm: Introduction - The Nature of Code
2016-07-27Live Stream #54 - Phyllotaxis and More on Genetic Algorithms
2016-07-25Coding Train Live 52: Genetic Algorithms
2016-07-2111.10: Computer Vision: Adding Lifespan to Blobs - Processing Tutorial
2016-07-2011.9: Computer Vision: Blob Tracking with Persistence - Processing Tutorial
2016-07-19Q&A #3: How to contribute to p5.js
2016-07-19Q&A #4: Loading Animation in p5.js
2016-07-18Coding Train Live 51: Loading Animation Q&A and Blob Detection with Persistence
2016-07-189.15: 2D Arrays in JavaScript - p5.js Tutorial


Tags:
genetic
nature of code
algorithm
the nature of code
daniel shiffman
creative coding
genetic algorithms
evolution
genetic algorithm
coding
p5.js
p5js
p5.js tutorial
object oriented programming
shakespeare monkey
infinite monkey
genotype
phenotype
genotype vs phenotype
DNA
Darwin
evolutionary
evolutionary computing
survival of the fitest
evolutionary algorithm