Thank you very much...]]>

Please help me how to submitte my first assignment and how to find my second assignment on Additional Resources

thank you]]>

May I ask for past material for the following subject, I will be taking these modules in 2012. Please kindly send to sedeya@gmail.com

(COS2621) Computer organization (Computer Science 221)

(COS2661) Formal logic 2 (Computer Science 261)

(INF3705) Advanced systems development (Information Systems 305)

(COS3701) Theory of computer science 3 (Computer Science 301)

(COS3711) Advanced programming (Computer Science 311)

(COS3721) Operating systems and architecture (Computer Science 321)

(COS3712) Computer graphics (Computer Science 340)

(COS3761) Formal logic 3 (Computer Science 361)

(COS3751) Techniques of artificial intelligence (Computer Science 351)

Thanks in advance.

Regards

Rutendo.]]>

I found it to be a fair exam, pity I didn't focus enough on last semesters exam!

Really got stuck drawing the 'tree' for the coyote and jackal, missed some give away marks! Hoping for a pass!!!

Q1

Coyote and Jackal (ie Missionaries and Cannibal)

Define state space and start state and goal

Q2

CSP

Cryptarithmetic

SEND

MORE

----

MONEY

q3

Follow the path of the tree for

3.1)Depth first

3.2)Breadth First

3.3) To find Node N trace the path of iterative deepening search

Q4

Alpha Beta

Q5

CNF

Q6

Decision Tree

(Suntanned / Hair)

Missing one question]]>

the order in which the nodes are visited are: A, B, D, J, E, K, F, L, C, G, N, O, H, P

I got the values to be A = 3

B= 3

D = 3

E = 5

F = 6 ( A beta cutoff occurs at M because 6 > the beta value of B (3)

C = 2 (An alpha cutoff occurs at I because 2 < alpha value of A (3)

G = 8

H = 2]]>

http://www.ai-class.com/home/]]>

Nodes: generated, visited and expanded?]]>

For question 5, here are the steps that I have followed but I am not convinced that it is correct.

1. From the bottom "Leave" nodes I choose the minimum values and prune the secondary nodes if the first node of that branch is already smaller than the first smallest node from the left.

2. These minimums from step 1 I now promote to the second level from the bottom . I.E. "H,I,J,K,L,M,N"

3. On this "H,I,J,K,L,M,N" level I now choose the max values and promote those to the next level "D,E,F,G" pruning as I go along.

4. On the "D,E,F,G" level I now chose the Minimums again and promote them to "B,C"

5. Finaly from the "B,C" level I choose the Maxim again and promote to "A"

Was this approach correct?]]>

If anyone has last semesters or last years solutions to the assignments, could you please email me at mightybrad@gmail.com

Thanks!]]>

In section

I also assumed that the

Please correct me if I'm wrong. I hope somebody will be able to clarify about the

Anybody done with Assignment 1? Any problems with any questions we can discuss on this forum. Let's try to keep this forum alive ppl.]]>

CSP

Resolution Refutation

I had to start this again. It went through twice to get the refutation. Clause 1 was key

A*

Don't know if I did the nodes correctly. Actually have no idea if the entire question came out correctly.

Alpha-Beta?

CNF

Decision trees

Couldn't answer the definitions properly. Spent to much time learning how to do the practical.]]>

Procedure:

1. Find entropy of entire test set

2. Find Entropy of each variable in set

3. Calculate information Gain for each entire variable set

4. Place root node of highest IG

5. Calculate IG for each variable relating to previous node

6. Add node of highest information gain to previous node or add leaf node

7. loop 5

Only add variable nodes that continue to provide information <- How do I state that in a better way]]>

very brief English -> FOL]]>

They use some software examples as well, but the Var, Dom, and Constraints are useful.]]>

Chapter 2

Chapter 3

Chapter 4a

Chapter 4b

Chapter 5

Chapter 6

Chapter 7

Chapter 9a

Chapter 9b

Got some more.. Will look through my stuff later.

Lect 1 <- Change the URL from lect1.pdf - 27 (Sorry it's in my dropbox and am using it to study on the road. so not zipped into one file)

A lot of you may already have these. Hope they help.

Cheers]]>

pls can someone email me the tut letters and whatever solutions are available asap, my internet access is severely limited at the moment.

Thank you kindly!

34177531@mylife.unisa.ac.za]]>

JoJ.]]>

jaffar@vodamail.co.za]]>

http://www.ocf.berkeley.edu/~yosenl/extras/alphabeta/alphabeta.html]]>

ok, here goes. The A/B game on page 197, last question of the assignment. I drawn the states,

I can see that with optimal moves, player A will win always. If not playing optimally, B might win as well.

Ive got total of 11 states, of which two are terminal states on for B winning and one for A winning. I also have two loop states.

have you guys got something similar?

and now for the real question: I have to assign minimax values... what kind of values do you assign..? should we just think up our own, based on the optimality of the moves?

eg.

If it leads to a win, make it 1000, else 10?

not sure how they want us to do here.]]>

any help would be appreciated.

many thx

danie]]>