Mn thi: Tr tu nhn to

KHOA KHOA HC V K THUT MY TNH B MN KHOA HC MY TNH

THI GIA K
MN THI: TR TU NHN TO THI GIAN: 60 PHT
Sinh vin c php s dng ti liu Sinh vin khng c php s dng ti liu

Cu 1: Tm kim (3 im) S dng gii thut Leo i n gin (Simple Hill Climbing) v cy tm kim n su l 3 (tc l 3 bc di chuyn) cho bi ton Blocks World vi trng thi khi u v trng thi mc tiu nh Hnh 1, s dng hm lng gi sau y: - i vi mi khi nm trn cc khi nh trng thi mc tiu: + 1 i vi mi khi bn di khi ny. - i vi mi khi nm trn cc khi khng nh trng thi mc tiu: - 1 i vi mi khi bn di khi ny. Nu c nhiu trng thi tip theo c cng lng gi tt nht, th sinh vin c th ty chn mt trng thi trong s .
B D A Khi u C C B D A Mc tiu tiu

Hnh 1

Cu 2: Tr chi (3 im) Xt gii thut Minimax trong mt tr chi vi cy trng thi v cc lng gi tnh ti cc nt l nh Hnh 2. Gi s ngi chi u tin (bt u t nt gc) ng vi bc di chuyn theo lng gi nh nht (min).
..

Trang 1/3

Mn thi: Tr tu nhn to

a. Ngi chi u tin nn chn bc di chuyn no? (1.5 im) b. Cho bit nhng nhnh no trn cy s c b qua khi p dng gii thut ct b alphabeta, gi s th t duyt cc nhnh cy t tri sang phi. (1.5 im)
A MIN B MAX E MIN K 8 L 10 M -5 N 9 O 22 P 14 Q -4 R 0 S 7 T T 3 U -2 V 6 F G H I J C D

Hnh 2 Cu 3: Lp k hoch (4 im) Bi ton con kh v qu chui c m t nh sau: trong mt cn phng c mt con kh v mt qu chui treo trn trn (ca cn phng) vt ra ngoi tm vi ca con kh. Trong phng c mt ci hp cho php con kh tip cn c qu chui nu leo ln . Khi u, con kh v tr A, qu chui v tr B, v ci hp v tr C. Con kh c chiu cao low; v c th t leo ln hp nu cng v tr vi hp. Khi ng trn hp con kh c chiu cao high v vi ti c qu chui nu cng v tr vi qu chui. S dng cc v t (predicate), cc hnh ng (action) bn di, v p dng gii thut Goal Stack Planning lp k hoch cho con kh ly c qu chui. Cc v t: At(X): con kh v tr X; Level(low/high): con kh ang cao low/high; BoxAt(X): ci hp v tr X; BananaAt(X): cc tri chui v tr X; Have(banana): con kh ly c chui. Cc hnh ng: Go(X, Y): con kh di chuyn t v tr X n v tr Y; Push(X, Y): con kh y ci hp t v tr X n v tr Y; ClimbUp(X): con kh leo ln ci hp ti v tr X; ClimbDown(X): con kh leo xung ci hp ti v tr X; Grasp(X): con kh ly qu chui ti v tr X.

..

Trang 2/3

Mn thi: Tr tu nhn to

a. Vit cc c t (precondition, add list, v delete list) cho cc hnh ng ca con kh. (2 im) b. Cho bit ni dung Stack ng vi tng bc chy khi p dng gii thut Goal Stack Planning tm chui hnh ng cho con kh trong bi ton trn. khng phi v qu nhiu hnh Stack, c th gom cc bc lin tip tho mn cc mc tiu con hin nhin (tc khng cn hnh ng ca robot) thnh mt bc. (2 im)

-----------------HT------------------

Ch nhim B mn Ch k:

Ging vin ra Ch k:

H tn:

H tn:

..

Trang 3/3