I'm having difficulty in understanding this problem. My comprehension of the lesson did not allow me to carry the concept of A * from search trees for this problem with grids. I think I'd need more examples of A* and admissibility of heuristics to be capable of understand and resolve the problem.
just 500 views , i thought there will be atleast 10,000 or even more as each person submitting the hw may see the video more than once to check himself
@progenitor00 Out of 700 odd views, less than 10 people posted comments here. Fat chance that there will be many comments ever, even less posted answers.
Also, we don't NEED to know the heuristic function to see if it is admissible or not, just its value on each node, and that's exactly what we have here. Of course also need to know what's the real cost to move between the nodes, and again, I think it's safe to assume that for every move costs 1.
Does it really matter if it can move diagonally? The only difference would be that there would have more than one point with the same value of the cost plus heuristic function, and so we would have to set a way to choose between the nodes. This way there would be a set of different acceptable (correct) answers.
I guess the safest way is to assume it can only move vertically and horizontally, since there would be just only one correct answer.
As others have said, we're not given all of the information. Can we move diagonally? If we go by your previous videos and by the AI: A Modern Approach book, these examples are laid out like a number puzzle with only up, down, left, and right moves.
Also, you did not write out a heuristic function, but rather the resulting moves, so how are we to know if the heuristic function is admissible? We can't see the function, only the results. And there are multiple ways to reach those results.
160K people enrolled the course. Homework 1, task 7 has 1300+ views. What the effing lazy people!
aatapin 4 months ago
Guy the teachers would have thought of issues if it was not enough.
Thanks great learning.
puneet0303 4 months ago
Thank you for the first week. I really enjoyed it. \:D/
zaxele 4 months ago
Clarifications:
Diagonal moves are NOT allowed.
Assume a1 is already expanded.
The cost of moving from one box to another (path cost) is 1 everywhere.
Use <= for the definition of admissible.
jimgblk 4 months ago 2
I'm having difficulty in understanding this problem. My comprehension of the lesson did not allow me to carry the concept of A * from search trees for this problem with grids. I think I'd need more examples of A* and admissibility of heuristics to be capable of understand and resolve the problem.
SedeDeSaber 4 months ago 2
just 500 views , i thought there will be atleast 10,000 or even more as each person submitting the hw may see the video more than once to check himself
ppandeydcealum 4 months ago
lawl. You should probably turn off comment in case some troll decides to post the answers.
progenitor00 4 months ago
@progenitor00 Out of 700 odd views, less than 10 people posted comments here. Fat chance that there will be many comments ever, even less posted answers.
DoomBakery 4 months ago
The first node to expand (a2 or b1) would imply that we cannot go diagonally.
strikers1942 4 months ago 6
Also, we don't NEED to know the heuristic function to see if it is admissible or not, just its value on each node, and that's exactly what we have here. Of course also need to know what's the real cost to move between the nodes, and again, I think it's safe to assume that for every move costs 1.
Metabee 4 months ago
Does it really matter if it can move diagonally? The only difference would be that there would have more than one point with the same value of the cost plus heuristic function, and so we would have to set a way to choose between the nodes. This way there would be a set of different acceptable (correct) answers.
I guess the safest way is to assume it can only move vertically and horizontally, since there would be just only one correct answer.
Metabee 4 months ago
As others have said, we're not given all of the information. Can we move diagonally? If we go by your previous videos and by the AI: A Modern Approach book, these examples are laid out like a number puzzle with only up, down, left, and right moves.
Also, you did not write out a heuristic function, but rather the resulting moves, so how are we to know if the heuristic function is admissible? We can't see the function, only the results. And there are multiple ways to reach those results.
ciphernemo 4 months ago
What's the actual cost function? Seems like move from a1 to b1 is 1. But can you move from a1 to b2 as 1 or is it two? The answer depends on that.
bricenn 4 months ago 7
@bricenn I wholeheartedly agree. We're not given all the information.
marcspoor 4 months ago