8 Puzzle Problem using Manhattan Distance in Artificial Intelligence

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

КОМЕНТАРІ • 58

  • @josef-jayabiada221
    @josef-jayabiada221 4 роки тому +11

    can i ask? what would i choose if i have the same M Values?

    • @ThinkXAcademy
      @ThinkXAcademy  4 роки тому +5

      If you get the same manhattan distance which is highest among all the paths, calculate the manhattan distance for the next state of the paths with same manhattan distance and then choose the minimum. Another way is to merge the paths of same manhattan value into one and proceed with the algo.

    • @josef-jayabiada221
      @josef-jayabiada221 4 роки тому +2

      @@ThinkXAcademy Thank You!

  • @martinwilliams1308
    @martinwilliams1308 3 роки тому +1

    This really helped me when I was working on an assignment. Thanks!!

    • @ThinkXAcademy
      @ThinkXAcademy  3 роки тому

      That's great! Share our content with others to help this channel grow💯

  • @AnkitKumar-zy9pb
    @AnkitKumar-zy9pb 2 роки тому +1

    What happen when all possible node value is equal the where to go?

  • @piotres5373
    @piotres5373 3 роки тому +2

    You save my day! THX bro

  • @caljohn1475
    @caljohn1475 3 роки тому +2

    brilliant explanation

  • @shehabalmughalles8017
    @shehabalmughalles8017 2 роки тому +1

    Thank you.

  • @alirezadoroudi9126
    @alirezadoroudi9126 Рік тому

    Thank you so much

  • @ratneshjha3229
    @ratneshjha3229 4 роки тому +3

    Suggestion - Go a bit faster, it's great but I had to watch it at 1.5x speed

  • @EasyCodingStudio
    @EasyCodingStudio 2 місяці тому

    nice explanation

  • @Bosco-sb5dc
    @Bosco-sb5dc Рік тому

    well explained !, thank you!

  • @ChandaniGajera
    @ChandaniGajera 2 місяці тому

    What should I do if I get same Manhattan value for next 2 steps... And not possible any other movement

  • @sireeshagandavaram8469
    @sireeshagandavaram8469 Рік тому

    Nice explanation sir tq sir 👍 😊

  • @Evan_411
    @Evan_411 11 місяців тому

    thanks a lot bro

  • @aleksandarpetrovic2632
    @aleksandarpetrovic2632 2 роки тому

    Awesome tutorial, thank you!

  • @johnmackenzie3871
    @johnmackenzie3871 2 роки тому

    Good video, thank you.

  • @andarithaneshafitri7306
    @andarithaneshafitri7306 3 роки тому +1

    Thanks

  • @nitsanbh
    @nitsanbh Рік тому

    slowest pace to the point I have ever seen in a video. consider using a heuristic to get to the goal point faster

  • @suhaibgbrtee4031
    @suhaibgbrtee4031 2 роки тому

    thank u soo much but there is notice u have said that the first box has only 3 new possibility and the forth one will return us to the same original box so it should be eliminated but u forgot to do it for the remaining boxes ,
    with the same implemented method there should be only one new possibility for each of the 2 remaining boxes

  • @VedOfficial
    @VedOfficial Рік тому

    Made my task easy❤🎉

  • @hit1599
    @hit1599 3 роки тому +1

    I used the same methods but just using the manhattan distance causes the program to go into infinite loops for certain cases. Will like to hear the solution for this.

    • @ThinkXAcademy
      @ThinkXAcademy  3 роки тому

      you will have to learn on how to write conditions that stops the loop and return the result

  • @marouenkadri8771
    @marouenkadri8771 4 роки тому +1

    Sear how we implement this algo , what can of data structure used ?

  • @satvikarya569
    @satvikarya569 2 роки тому

    ThankYou very much 👌👌

    • @ThinkXAcademy
      @ThinkXAcademy  2 роки тому

      Please share our videos to help this channel grow🌟

  • @amirbaba9677
    @amirbaba9677 3 роки тому

    thanks alot

  • @prajjwaltripathi2911
    @prajjwaltripathi2911 2 роки тому

    Helpful

  • @guilhermedias6018
    @guilhermedias6018 2 роки тому

    thanks

  • @hananal6493
    @hananal6493 3 роки тому +1

    Hello doctor, can I communicate with you?

  • @hdvlogs4485
    @hdvlogs4485 2 роки тому +1

    there is so much lag in is there in you tutorial try to avoid it

    • @ThinkXAcademy
      @ThinkXAcademy  2 роки тому +1

      I am sorry i didn't have a good smartphone back then so there was lag, i have upgraded now and content is also improving👍🏻

  • @FreeMayaTutorials
    @FreeMayaTutorials 3 роки тому +1

    Could you generalize this technique to play any game optimally that would lend itself well to various states where an m distance calculating function could be used?

    • @ThinkXAcademy
      @ThinkXAcademy  3 роки тому

      I will create a separate video for that soon✔️👍🏻

    • @FreeMayaTutorials
      @FreeMayaTutorials 3 роки тому +1

      @@ThinkXAcademy That would be great, thank you very much!

  • @rodrigol.1869
    @rodrigol.1869 2 роки тому

    I have a doubt regarding the code implementation of this. What should I do when all the possible branches were already visited but the solution hasn't been found yet? Should I try a different heuristic?

    • @ThinkXAcademy
      @ThinkXAcademy  2 роки тому

      No, try a different source to start the algo.

  • @dimitrisz840
    @dimitrisz840 3 роки тому

    Hey nice explanation there! Quick q, why is this heuristic preffered to the missing tiles one?

  • @AnkitKumar-zy9pb
    @AnkitKumar-zy9pb 2 роки тому +1

    you are taking non solvable example bro

  • @TheClockmister
    @TheClockmister 2 роки тому

    Can you say "Pubg mobile" for me?