p n Cu 1: a/ (2d) Lan truyn ngc gi tr hm nh gi su 3 ln cc node trn ca cy theo thut ton minimax th node gc ca cy c gi tr: 88; Max s i theo

eo nhnh right b/ (1d) Lan truyn ngc gi tr hm nh gi su 4 ln cc node trn ca cy theo thut ton minimax th node gc ca cy c gi tr: 17; Max s i theo nhnh left c/ (1d) La chn su tm kim trong cc gii thut tr chi ph thuc vo b nh v tc ca my tnh. V nguyn tc l chn cng su cng tt (nu chn n cc node kt thc ca tr chi th m bo chn c cch i ti u) khi b nh v tc ca my tnh cho php Cu 2: a/ (2d) Biu din cc cu trong Prolog: cha(sam,mike). cuoi(mike, alice). qhgg(X,Y):-cuoi(X,Y). qhgg(X,Y):-cha(X,Y). quen(X,Z):-qhgg(X,Y),qhgg(Y,Z). b/ (1d) Vi suy din tin th t c s tri thc trn c th sinh ra cc cu mi sau: qhgg(sam,mike). qhgg(mike,alice). quen(sam,alice). Ngoi ra khng cn cu mi no c sinh ra t c s tri thc trn. V vy ch c th kt lun Sam l ngi quen ca Alice ch khng kt lun c Mike l ngi quen ca Alice c/ (2d) Biu din c s tri thc dng chun hi trong logic v t 1. cha(sam,mike). 2. cuoi(mike, alice).

3. X, Y cuoi(X,Y) qhgg(X,Y). Hay tng ng : cuoi(X,Y) qhgg(X,Y) 4. X, Y cha(X,Y) qhgg(X,Y). Hay tng ng: cha(X,Y) qhgg(X,Y) 5. X, Y, Z [qhgg(X,Y) qhgg(Y,Z) quen(X,Z)] Hoc X, Z {Y [qhgg(X,Y) qhgg(Y,Z)] quen(X,Z)}. C hai cu ny tng ng vi: qhgg(X,Y) qhgg(Y,Z) quen(X,Z) d/ (1d) Bng cc lut phn gii, c s tri thc c th sinh ra cc cu mi sau: 6. qhgg(sam,mike) (p dng lut phn gii cho 1 v 4) 7. qhgg(mike,alice) (p dng lut phn gii cho 2 v 3) 8. qhgg(mike,Z) quen(sam,Z) (p dng lut phn gii cho 5 v 6) 9. quen(sam,alice) (p dng lut phn gii cho 7 v 8) Ngoi ra khng cn cu mi no c th sinh ra t c s tri thc trn. Nh vy t c s tri thc trn khng chng minh c Mike l ngi quen ca Alice.