Welcome!
Log In
Create A New Profile
Home
>
2012
>
COS3751
> Topic
Advanced
Assignment 1 Question 4
Posted by
Rbuys
Announcements
Last Post
SoC Curricula
09/30/2017 01:08PM
Demarcation or scoping of examinations and assessment
02/13/2017 07:59AM
School of Computing Short Learning Programmes
11/24/2014 08:37AM
Unisa contact information
07/28/2011 01:28PM
Forums
Messages
New
Rbuys
Assignment 1 Question 4
August 03, 2012 12:50PM
Registered: 13 years ago
Posts: 19
Rating: 0
In figure 5, what are the weightings for the unmarked nodes to be taken as? 0? I get to a point in applying the best-first algorithm where the least cost node is N, meaning I and J would be next. Is this correct? (2012-07-29 12:27)
Reply
Quote
Rbuys
Re: Assignment 1 Question 4
August 05, 2012 01:14PM
Registered: 13 years ago
Posts: 19
Rating: 0
Ok, I see my error. f doesn't accumulate, ie we only ever look at the frontier values.
Reply
Quote
AndreB
Re: Assignment 1 Question 4
August 19, 2012 08:21PM
Registered: 18 years ago
Posts: 1,501
Rating: 0
Well - more accurately, g(n) does not accumulate in Best-first search, only in A*.
They only give us the h values so that's all that can be used.
Reply
Quote
Newer Topic
Older Topic
Print View
RSS
Sorry, only registered users may post in this forum.
Click here to login