# Genetic Algorithms in Elixir: Chapter 1 sample implementation in Ruby finds a solution much faster

**URL:** <https://forum.devtalk.com/t/genetic-algorithms-in-elixir-chapter-1-sample-implementation-in-ruby-finds-a-solution-much-faster/58194>\
**Category:** PragProg Customers\
**Tags:** book-genetic-algorithms-in-elixir\
**Created:** [4 June 2022 23:57 UTC](https://forum.devtalk.com/t/genetic-algorithms-in-elixir-chapter-1-sample-implementation-in-ruby-finds-a-solution-much-faster/58194 "2022-06-04T23:57:00Z")\
**Posts on this page:** 1\
**Showing post:** 2

<div class="post-metadata">

**Author:** ![kdiogenes](https://forum.devtalk.com/user_avatar/forum.devtalk.com/kdiogenes/32/4234_2.png) [@kdiogenes](https://forum.devtalk.com/u/kdiogenes)\
**Post date:** [15 July 2022 18:24 UTC](https://forum.devtalk.com/t/genetic-algorithms-in-elixir-chapter-1-sample-implementation-in-ruby-finds-a-solution-much-faster/58194/2 "2022-07-15T18:24:54Z")

</div>

After going further in the book (the algorithms have more output) I verified that the ruby implementation takes more generations to find the solution, but it runs each generation faster.

---

_[View the full topic](https://forum.devtalk.com/t/genetic-algorithms-in-elixir-chapter-1-sample-implementation-in-ruby-finds-a-solution-much-faster/58194)._
