Homework 1, Question 7, A* Search
Loading...
Top Comments
All Comments (14)
-
160K people enrolled the course. Homework 1, task 7 has 1300+ views. What the effing lazy people!
-
Guy the teachers would have thought of issues if it was not enough.
Thanks great learning.
-
Thank you for the first week. I really enjoyed it. \:D/
-
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.
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.
4 months ago 2
-
@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.
-
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
-
lawl. You should probably turn off comment in case some troll decides to post the 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.
- 1:45
Homework 1, Question 7, A* Search ANSWERby knowitvideos2,483 views
- 1:00
Homework 1, Question 6, Search Networkby knowitvideos1,785 views
- 0:44
Homework 1, Question 4, Search Treeby knowitvideos1,959 views
- 0:32
Homework 1, Question 5, Another Search Treeby knowitvideos1,663 views
- 0:29
Unit 2, Topic 10, Graph Search Answerby knowitvideos5,042 views
- 1:31
Unit 2, Topic 11, Graph Search Terminationby knowitvideos5,092 views
- 0:24
Unit 2, Topic 26, A-Star Fourth Question ANSWERby knowitvideos3,447 views
- 4:29
Unit 2, Topic 22, More on Uniform Cost Searchby knowitvideos5,218 views
- 0:57
Unit 2, Topic 14, Uniform Cost Searchby knowitvideos5,231 views
- 0:15
Unit 2, Topic 23, A-Star Search ANSWERby knowitvideos3,850 views
- 1:50
Unit 2, Topic 31, Sliding Blocks Puzzleby knowitvideos5,113 views
- 1:14
Unit 2, Topic 16, Uniform Cost Terminationby knowitvideos4,412 views
- 1:00
Unit 2, Topic 29, State Spacesby knowitvideos4,389 views
- 2:03
Unit 2, Topic 20, Storage Requirements, Completenessby knowitvideos4,900 views
- 0:50
Unit 2, Topic 21, Completeness Answerby knowitvideos4,782 views
- 0:23
Homework 1, Question 1, Peg Solitaire ANSWERby knowitvideos765 views
- 0:13
Unit 2, Topic 24, A-Star Second Question ANSWERby knowitvideos3,508 views
- 0:50
Homework 1, Question 6, Search Network ANSWERby knowitvideos875 views
- 1:45
Unit 2, Topic 30, State Space Diagram and More Complexityby knowitvideos4,756 views
- 1:51
Unit 2, Topic 18, Depth First Searchby knowitvideos6,448 views
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
The first node to expand (a2 or b1) would imply that we cannot go diagonally.
strikers1942 4 months ago 6