What You Learned
Genetic Algorithms in Elixir — by Sean Moriarity (18 / 101)
👈 Adding Mutation | TOC | Chapter 2 Breaking Down Genetic Algorithms 👉
In this chapter, you learned about informed search and why it’s superior to brute-force search for finding solutions to difficult problems. You also learned about the types of problems, like finding an optimal shipping route between cities, that are nearly impossible to solve using brute-force search. Most importantly, you learned what genetic algorithms are and how to implement a basic genetic algorithm to solve the One-Max problem.
In the next section, you’ll take the genetic algorithm you created here and use it to start implementing a general framework that you can apply to numerous other problems.
Footnotes
[4] https://hexdocs.pm/elixir/Enum.html
Copyright © 2021, The Pragmatic Bookshelf.
👈 Adding Mutation | TOC | Chapter 2 Breaking Down Genetic Algorithms 👉
Genetic Algorithms in Elixir by Sean Moriarity can be purchased in other book formats directly from the Pragmatic Programmers. If you notice a code error or formatting mistake, please let us know here so that we can fix it.
