Yioop - PHP Search Engine

Midterm practice test solutions.

Here is our solution for 4. From Bundit Hongmanee, Changtong Zhou and Jonathan Neel:

4. Briefly explain the Greedy Best First Search algorithm and the A⋆-algorithm. Give a concrete example where they would expand nodes different when performing a search.

Resource Description for Screen Shot 2017-10-02 at 9.39.40 PM.png

Resource Description for Screen Shot 2017-10-02 at 9.00.11 PM.png

Here is our solution for 4. From Bundit Hongmanee, Changtong Zhou and Jonathan Neel: 4. Briefly explain the Greedy Best First Search algorithm and the A⋆-algorithm. Give a concrete example where they would expand nodes different when performing a search. ((resource:Screen Shot 2017-10-02 at 9.39.40 PM.png|Resource Description for Screen Shot 2017-10-02 at 9.39.40 PM.png)) ((resource:Screen Shot 2017-10-02 at 9.00.11 PM.png|Resource Description for Screen Shot 2017-10-02 at 9.00.11 PM.png))

-- Midterm practice test solutions

 Group Members (Last, First):	
 Derdak, Achraf
 Leong, Alec
 Pham, Bao

Solution #8: Click Here

 Yiopp is giving me an error when attempting to upload a file.

 As an alternative, I uploaded the solution to #8 onto Microsoft's OneDrive. See the link here: https://1drv.ms/b/s!AskD1vqtsHfcauiP9ab06_li4Dk

(Edited: 2017-10-03)

'''Group Members (Last, First):''' Derdak, Achraf Leong, Alec Pham, Bao '''Solution #8:''' [[https://1drv.ms/b/s!AskD1vqtsHfcauiP9ab06_li4Dk|Click Here]] Yiopp is giving me an error when attempting to upload a file. As an alternative, I uploaded the solution to #8 onto Microsoft's OneDrive. See the link here: [[https://1drv.ms/b/s!AskD1vqtsHfcauiP9ab06_li4Dk|https://1drv.ms/b/s!AskD1vqtsHfcauiP9ab06_li4Dk]]

-- Midterm practice test solutions

i believe there is an issue with the a* explanation here if the euclidean is heursitic then it will most likely take the left branch as the tie breaker(unless otherwise in code). which means it does not visit the right side. f(a)= 0+ 3=3 , f(b) = 1+2= 3, f(c)= 2+1= 3, f(d)= 3+0 = 3, f(e)= 2+1= 3, f(f)= 3+1= 4

a -> (b) | e ->(c) | e ->(d) | e-> d is realized to be goal > path is "a>b>c>d"

i believe there is an issue with the a* explanation here if the euclidean is heursitic then it will most likely take the left branch as the tie breaker(unless otherwise in code). which means it does not visit the right side. f(a)= 0+ 3=3 , f(b) = 1+2= 3, f(c)= 2+1= 3, f(d)= 3+0 = 3, f(e)= 2+1= 3, f(f)= 3+1= 4 a -> (b) | e ->(c) | e ->(d) | e-> d is realized to be goal > path is "a>b>c>d"