# sample paper, let's compare

Announcements Last Post
: Programming Students at UNISA School of Computing 06/19/2019 02:01PM
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
 sample paper, let's compare September 16, 2006 08:00AM IP/Host: 81.52.163.--- Registered: 14 years ago Posts: 18 Rating: 0
Hi everyone,
For question 4 of the sample paper,
I found the following final graph when a node of depth 4 is to be expanded:
G = {1,2,3,6,7,10,11,4,8,12,13,9,5}
As for OPEN = {10,13,6,9,11,12}
and CLOSED = {1,2,3,4,5,7,8}

For Question 5
I found AB(A, -infinity, infinity)=1
and the cut off nodes are node G and hence O and P and it is an alpha cutoff.

I am a bit stuck on question 7 b,c and d????

 Re: sample paper, let's compare September 18, 2006 01:43AM IP/Host: ---.dialup.ihug.co.nz Registered: 13 years ago Posts: 25 Rating: 0
Hi

Question 4 I get the same answer

Question 5 A = 1

Cut off nodes are Alpha cut K,L
and Beta cut node G
 Re: sample paper, let's compare September 20, 2006 10:58AM IP/Host: 195.22.223.--- Registered: 14 years ago Posts: 15 Rating: 0
Question 5

A = 1

alpha cut off at G

Question 6.1

1. Use the negation of r as the set of support and resolve to nil?

1. not q or r
2. not p or q
3. p
4. not r - - - - negation of goal as set of support
5. not q - - - - - - 1 & 4
6. not p - - - - 2 & 5
7. nil - - - - - 3 & 6

or

2. Use the final clause as the set of support and resolve to r?

1. not q or r
2. not p or q
3. p
4. q - - - - - - - 2 & 3
5. r - - - - - - - 1 & 4

Which method??
 Anonymous User Re: sample paper, let's compare October 05, 2006 12:00AM IP/Host: ---.saix.net Rating: 0
For 4.1

how did you get closed = {1,2,3,4,5,7,8}

please check if this is correct

step 1:You take node 1 put it on G put 1 on open
step 2:create list closed
step 3:
step 4:take 1 from open put into closed.closed = {1}
step 5:
step 6:expand node 1 set as m={2 3 4 5} install on G
G has nodes 1 2 3 4 5 on it
step 7:nodes not on open and closed are {2 3 4 5}
add these to open. open ={2 3 4 5}
step 8:reorder open. open = {2 3 4 5}

step 3:
step 4:take 2 from open put into closed.closed = {1,2}
open = { 3 4 5}
no expansion go to step 3

step 3:
step 4:take 3 from open put into closed.closed = {1,2,3}
step 5:
step 6:expand node 3 set as m={6,7} install on G
G has nodes 1 2 3 4 5 6 7 on it
step 7:nodes not on open and closed are {6 7}
add these to open. open ={4 5 6 7}
step 8:reorder open. open = {7 4 5 6}

step 3:
step 4:take 7 from open put into closed.closed = {1,2,3,7}

 Anonymous User Re: sample paper, let's compare October 05, 2006 11:04AM IP/Host: ---.alcatel.fr Rating: 0
You are correct vaughnp.
Closed is {1,2,3,7} and if you continue regardless you should get {1,2,3,7,10,4,8,13}.

The above answers you get if don't do a reorder by some heuristic. You must reorder after every node generation for an A* search.
 Re: sample paper, let's compare October 05, 2006 04:30PM IP/Host: ---.3g.vodacom.co.za Registered: 13 years ago Posts: 27 Rating: 0
I got the cut off nodes off K L and G. The closed list is as what Marius resolved. However the values of g, h(hat) and f(hat) are still required for the list on closed.

g = 1,2,3,4
h(hat) = 4,4,4,3
f(hat) = 5,6,6,6
Sorry, only registered users may post in this forum.