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.
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
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.
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?
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?
can i ask? what would i choose if i have the same M Values?
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.
@@ThinkXAcademy Thank You!
This really helped me when I was working on an assignment. Thanks!!
That's great! Share our content with others to help this channel grow💯
What happen when all possible node value is equal the where to go?
You save my day! THX bro
Keep Learning 🌟
brilliant explanation
Thank you😄 Keep Learning ✔️
Thank you.
Keep Learning 💯
Thank you so much
Suggestion - Go a bit faster, it's great but I had to watch it at 1.5x speed
nice explanation
well explained !, thank you!
Share with other students also💫
What should I do if I get same Manhattan value for next 2 steps... And not possible any other movement
Nice explanation sir tq sir 👍 😊
thanks a lot bro
Awesome tutorial, thank you!
Welcome sir😄
Good video, thank you.
Thanks😃
Thanks
Keep Learning ✨
slowest pace to the point I have ever seen in a video. consider using a heuristic to get to the goal point faster
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
yes we can avoid repititive boxes
Made my task easy❤🎉
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.
you will have to learn on how to write conditions that stops the loop and return the result
Sear how we implement this algo , what can of data structure used ?
Priority Queues
ThankYou very much 👌👌
Please share our videos to help this channel grow🌟
thanks alot
keep Learning 💯👍🏻
Helpful
Thanks😄
thanks
Share and Subscribe🌟
Hello doctor, can I communicate with you?
yes doctor
there is so much lag in is there in you tutorial try to avoid it
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👍🏻
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?
I will create a separate video for that soon✔️👍🏻
@@ThinkXAcademy That would be great, thank you very much!
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?
No, try a different source to start the algo.
Hey nice explanation there! Quick q, why is this heuristic preffered to the missing tiles one?
manhattan distance
you are taking non solvable example bro
This example can not have solution
Can you say "Pubg mobile" for me?
Pubg Mobile