Genetic Algorithm Solves the Traveling Salesman Problem by Mimicking Evolution

Поділитися
Вставка
  • Опубліковано 10 лис 2024

КОМЕНТАРІ • 8

  • @paulchow611
    @paulchow611 21 день тому +1

    Bro. It's like watching another me in the opposite side of the world. I love Maths, Music, and programing. Your channel is full the topic that I usually think and play with. From 3n+1, game of life, and now TSP. ❤ Already subscribed. Keep going!

  • @Tomtom1056LMAO
    @Tomtom1056LMAO 2 місяці тому +2

    Underated! I love learning new stuff, and this channel never fails to deliver :D

  • @The-Martian73
    @The-Martian73 Місяць тому +1

    Wow, nice visuals, explanation

  • @archandset
    @archandset 3 місяці тому +3

    Another very creative video concept

  • @juancarlosurisbaz8547
    @juancarlosurisbaz8547 2 місяці тому +1

    Can You Rotate More Polygons On The Circle of Fifths?

  • @eprohoda
    @eprohoda 3 місяці тому

    how are you?- you created useful traveling- ;))

  • @ERRORRubiksZeraBrand
    @ERRORRubiksZeraBrand 3 місяці тому +1

    the nearest neighbor algorithm is actually Dijkstra's algorithm, just used alot

    • @yensteel
      @yensteel 3 місяці тому

      Good ole Dijkstra!