Theseus and the Minotaur | Exploring State Space

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

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

  • @mistycremo9301
    @mistycremo9301 Год назад +16

    Oh, you two nerds! You were working together all along, to advertise your videos to eachother.
    Thank you for doing that; I found two new nerds to follow, instead of just one.

  • @tamask001
    @tamask001 Год назад +15

    This was my favorite puzzle of AoC '22, not too easy, not too hard, possible to do by partial brute-force, and gives a good chance for going back and optimizing after submitting the answer.

  • @Number_Cruncher
    @Number_Cruncher Год назад +26

    Thanks for sharing. Your animations are very helpful. I can't wait to use it in the class room. Also thank you for your list of software that you used. The use of AI image generators is an interesting option that I haven't thought of so far.

  • @colehdlr
    @colehdlr Год назад +2

    Very interesting!
    Came here from Polylog's A* video, which references your video, but then I saw that your video also references his video! How did you guys do this, which was first?!
    Either way, great video lol!

    • @YTomS
      @YTomS  Год назад +1

      It was a collaboration (for some definition of the word :). The topic of the videos had some overlap so we decided to connect it this way.
      Thank you for the kind words!

  • @AzureLazuline
    @AzureLazuline Год назад +9

    this video is really good and well-explained! The only thing missing is having a few more example mazes for Theseus to dodge the Minotaur, just running through 3 or 4 of them in a few seconds each. It's always fun to unleash an algorithm on a bunch of examples to see if anything interesting happens!

  • @RequiosWoW
    @RequiosWoW Год назад +8

    Just started an AI course at my uni, but the professor is so confusing. This was a great introduction to the first few modules of my course thank you!

  • @hannahnelson4569
    @hannahnelson4569 Год назад +1

    This is really cool! Applying pathing algorithms to state space is something I haven't dived deeply into before! It seems really cool!

  • @Alveari
    @Alveari 11 месяцев назад

    Love IT! Dneska jsem kódil babylonskou věž, v pondělí mě čeká zkouška. Je to velice nápomocné. Náhodou jsem zjistil, že koukám na video od Tebe. :D

  • @jx2pd
    @jx2pd 7 месяцев назад

    Amazing animation and explanation!
    At first, it was difficult to understand the narration due to pronunciation, but I got used to it quickly 😆
    Great job on colab with Polylog as well 👏👏👏

  • @thecalculusofexplanations
    @thecalculusofexplanations Год назад

    Brilliant, thanks for a great watch!

  • @tenthlegionstudios1343
    @tenthlegionstudios1343 Год назад

    Best videos ever! You and polylog have a great way of showing these algorithms more in depth and it is much appreciated. Thanks for the content!

  • @charlesnathansmith
    @charlesnathansmith Год назад

    The 3D board was mindblowing

  • @uoitauz3296
    @uoitauz3296 Год назад

    crazy video. very nice explanation and I really really like that you build the code in an intuitive way along the video. great work!

  • @Charlie_Han
    @Charlie_Han Год назад

    very high quality video with detailed explaination, thanks for sharing.

  • @NeoAF10
    @NeoAF10 Год назад

    Thank you that was a phenomenal video!

  • @stanleyyelnats3799
    @stanleyyelnats3799 Год назад

    I loved that you included the code as well. Awesome video!

  • @mehranabi
    @mehranabi 4 месяца назад

    Great content! Thank you!

  • @TrendyLaughs
    @TrendyLaughs Год назад

    Very Good Video with good explaination. And very good use of animation to explain things . Like to see more videos like this.

  • @flaviomilazzo2588
    @flaviomilazzo2588 Год назад

    Great sharing

  • @paulniziolek9200
    @paulniziolek9200 Год назад +1

    This is a beautiful video.

  • @chrizzzly_hh
    @chrizzzly_hh Год назад

    Such a great video! Please keep that coming!

  • @chamiik
    @chamiik Год назад

    Amazing animation, really great work!

  • @zhiyinpan8321
    @zhiyinpan8321 8 месяцев назад

    this is an awesome video! fun and clear. I wonder what tool do you use to generate these videos....

  • @zaidalhussain889
    @zaidalhussain889 Год назад

    Great video, really satisfying visuals I just wanted to add that you could have done the wall-breaking version of the maze in O(n) using 0-1 BFS.

    • @YTomS
      @YTomS  Год назад +1

      How would you go about solving it? The weights here are 1-10 so it isn't entirely obvious how you can do that.

  • @abanobnasser7344
    @abanobnasser7344 Год назад

    Thanks

  • @Charlie_Han
    @Charlie_Han Год назад +1

    I am also a bit intrigued by the more efficient implementation of dijkstra algorithm mentioned in the video, do you mind give some hints or links on how to improve it? Thanks in advance!!

    • @YTomS
      @YTomS  Год назад +2

      The main idea is removing the need to add a state to the heap multiple times, but updating it in the heap instead. To do this quickly, you need to track their positions in the heap, which you can do using a dictionary. After you change the value in the heap (always to a smaller one), you also need to bubble it up to make sure the heap's conditions are not broken.

  • @bugrahanozcan8682
    @bugrahanozcan8682 4 месяца назад

    Average Factorio player:

  • @enjoful
    @enjoful 9 месяцев назад

    deque is not "deck" but "de queue"

  • @m3hdim3hdi
    @m3hdim3hdi Год назад +1

    great video man, but i had to keep pausing the video and seeking back to understand what you say because of your pronunciation of the words