Solving Mazes in Python: Depth-First Search, Breadth-First Search, & A*

Поделиться
HTML-код
  • Опубликовано: 13 сен 2024

Комментарии • 25

  • @enthusiastjumper8671
    @enthusiastjumper8671 4 месяца назад +2

    RUclips algorithm did recommend something awesome finally.

  • @matthewcarmody2283
    @matthewcarmody2283 2 года назад +9

    This is incredible, I cannot believe you dont have 100times more subscribers

    • @DaveKopec
      @DaveKopec  2 года назад +2

      No problem glad you found it useful.

    • @hiloworle7106
      @hiloworle7106 Месяц назад

      The scary part is that it shows the state of society.. not many people seek the right path in the maze of life..

  • @AAAA-rb2hm
    @AAAA-rb2hm 2 года назад +3

    I recommended your book to our University library, and they bought it for us, thanks, David.

  • @martindeveloper4856
    @martindeveloper4856 8 месяцев назад +1

    It always surprises me that high quality videos are underrated and especially their creators.
    The big problem I see in the video space is that people are only looking for short explanations and don't want to know the underlying things such as how is queue, stack and priority queue implemented. Even though those data structures are easy, this is not the point, the point I try to convey is that a approach from ground up takes longer to watch but in my opinion this facilitates the process of leaning the concept more easily and I guess also enabling the instructor to build on top of his explanation pyramid.
    And also I love your real world examples especially the one with the priority queue and the email inbox, quite intuitive and this video is a lot fun. I searched for a video about getting a refresher in common graph search algorithms after watching a little bit more about Machine Learning.
    Thanks a lot.

  • @akashkewar
    @akashkewar 2 года назад +7

    Amazing job @David Kopec. Waiting for more videos like this.

    • @DaveKopec
      @DaveKopec  2 года назад +1

      Thank you! Do plan on making more.

  • @user-hz2ne7xi4n
    @user-hz2ne7xi4n 11 месяцев назад +1

    you are a real champion..... thanks a lot................

  • @LiSek9611
    @LiSek9611 3 года назад +2

    perfect way to show how dfs works! MIT proffesor also talked about mazes with dfs:)

  • @ironman5034
    @ironman5034 2 года назад +1

    i haven't read you book yet, but due to the headache you saved me, i'll be downloading it shortly, am working on a warehouse simulator

    • @DaveKopec
      @DaveKopec  2 года назад +1

      Thanks for buying the book and hope the warehouse simulator goes well.

  • @melindayu8388
    @melindayu8388 2 года назад +1

    Thank you for sharing this!!!!!

  • @yougeshkumar8348
    @yougeshkumar8348 4 года назад +2

    very well explained 👍

  • @hiloworle7106
    @hiloworle7106 Месяц назад

    How can you modify the dfs in this example to have some utility.. for example... randomly generate the maze using the dfs itself.. and then solving using the BFs or astar..

    • @DaveKopec
      @DaveKopec  Месяц назад

      Sure, you could do that.

  • @innocent.amchechesi276
    @innocent.amchechesi276 3 года назад

    Can you please solve a maze for the longest path using ant system algorithm

  • @kishanjotaniya855
    @kishanjotaniya855 3 года назад

    how can i implement GUI which youve provided in github using a code of A* algo youve provided?

    • @DaveKopec
      @DaveKopec  3 года назад +1

      Going to leave that as an exercise for the watcher.

  • @abdallahaymanmohamedabuzai2663
    @abdallahaymanmohamedabuzai2663 3 года назад

    can you please provide us the A* gui implementation