Added: 4 years ago
From: CarlSvenbro
Views: 12,167
Sort by time | Sort by thread (beta)

Link to this comment:

Share to:

All Comments (11)

Sign In or Sign Up now to post a comment!
  • good stuff!

  • Hello, I'm learning about GP. The video is quite informative. You should make more in free time. I have been wondering about how would one program GP that learns to play checkers. More specifically what would the set of "IF" tests be? One for each square on a board? What about more complicated games - chess or computer strategy games? That would make tree-structures huge and relatively rational outcome practically impossible...

  • @kid29a i would assume that may be tough because it would take a full game to figure out which moves were more fit than others... i'm guessing the bug has a set time to cover as much as possible, this is relatively short compared to chess... checkers may be easier, since games can go faster... but this is all assumptions and i'm new to GP...

  • thanks for video

  • Seems pretty interesting. You should do more videos explaining this with different examples. Try giving the object a different task. How about you try one that can learn how to get out of a labyrinth in the least amount of time as possible and get it to improove doing different labyrinths. Then do a video of it. And put more energy too! lol

  • Great illustration. Thank you =)

  • this video is mine - awesome

    sohini chatterj

    I.S.B.R

  • it wasn't clear at first that the bug was not jumping around until the display was slowed down. Maybe you should explain that it's not jumping, but that you're just showing time lapse" photography

  • Thank you. This is a good learning clip. Keep going.

  • Thank you for this video.

  • can I download this?

Loading...
Alert icon
0 / 00Unsaved Playlist Return to active list
    1. Your queue is empty. Add videos to your queue using this button:
      or sign in to load a different list.
    Loading...Loading...Saving...
    • Clear all videos from this list
    • Learn more