62 4. FRONTIERS OF GVGAI PLANNING
4.2 STATE OF THE ART IN GVGAI PLANNING
4.2.1 OLETS (ADRIENCTX)
Open Loop Expectimax r
M
.n/
n
r
M
n
s
.n/
s n
s
.a/ a s
score D r
M
.a/ C
s
ln
.
n
s
.n/
/
n
s
.a/
:
taboo bias
1
T 10 < T < 30
4.2.2 TOVO2
4.2. STATE OF THE ART IN GVGAI PLANNING 63
Algorithm 4.5 n
s
.n/
n n
e
.n/ e R
e
.n/
n C.n/ n P .n/ n
Input: s
Input: T
Output: action
procedure s T
T root
while < T do
T s
end while
return D argmax
a2C.root/
n
s
.a/
procedure T s
0
s s
0
n root.T /
Exit
while :Final.s/ ^ :Exit do
if n then
a
s
n
Exit
else
a argmax
a2C.n/
na
n a
s
end if
end while
n
e
.n/ n
e
.n/ C 1
R
e
.n/ R
e
.n/ C Score.s/
while :P .n/ D ; do
n
s
.n/ n
s
.n/ C 1
r
M
.n/
R
e
.n/
n
s
.n/
C
.1n
e
.n//
n
s
.n/
max
c2C.n/
r
M
.c/
n P .n/
end while
..................Content has been hidden....................
You can't read the all page of ebook, please click here login for view all page.