MC LC

1.

2.

3.

4.

5.

CC NH NGHA ............................................................................................................................. 2
1.1.

Tr chi t hp (Combination game)........................................................................................ 2

1.2.

Tr chi cng bng (Impartial game) ........................................................................................ 2

1.3.

Qui c tr chi ....................................................................................................................... 2

1.4.

Tnh cht ca mt Impartial game ............................................................................................ 2

1.5.

Game tree: ............................................................................................................................... 3

TNG CA NHNG GAME T HP (SUMS OF COMBINATORIAL GAMES) ........................................ 4

2.1.

nh ngha................................................................................................................................ 4

2.2.

Game tng ng ................................................................................................................. 5

2.3.

Cc tnh cht ca tng hai Impartial game ................................................................................ 5

2.3.1.

B 1 ................................................................................................................................. 5

2.3.2.

B 2 ................................................................................................................................. 5

2.3.3.

B 3 ................................................................................................................................. 6

NH L SPRAGUE-GRUNDY ............................................................................................................. 6
3.1.

Hm Sprague-Grundy ca mt game tree................................................................................. 6

3.2.

Php ton XOR ......................................................................................................................... 9

3.3.

nh l Sprague-Grundy ........................................................................................................... 9

CC THUT TON VIT TRN C#: ..................................................................................................... 9

4.1.

Function tm mex: .................................................................................................................... 9

4.2.

Function tm nhng v tr sau n, vi tp lut SetS ...................................................................... 9

4.3.

Function tnh g(x) ti v tr n vi tp lut SetS ......................................................................... 10

4.4.

So snh kt qu vi cng thc:

...... 10

KT LUN....................................................................................................................................... 11
5.1.

g(x) i vi tr chi subtraction game co dng nh th no? ................................................. 11

5.2.

Lp ma trn tr chi 2 ng si, tm kim s tun hon trn ? ........................................... 11

L B TRNG KHANG
m bo ton K.20

1. CC NH NGHA
1.1. Tr chi t hp (Combination game)
L mt tr chi gm hai ngi chi vi thng tin y v khng c yu t may
ri (no chance move).
1.2. Tr chi cng bng (Impartial game)
Impartial game l mt Combination game trong mi ngi chi u c cc
bc i kh d l ging nhau trong mi bc i.
Ngc li trong Partizan game, mi ngi chi ch c di chuyn qun ca mnh
(ch khng di chuyn qun ca i th).
V d:
NIM: l mt Impartial game v hai i th u c quyn nh nhau trn mt
hay nhiu ng si.
Caro: mt ngi s nh l X, ngi kia nh l O nn l mt partizan game.
C tng: mt ngi s di chuyn qun mu trng, ngi kia di chuyn qun
mu nn l mt partizan game
1.3. Qui c tr chi
C 2 qui c chi nh sau:
i.
ii.

Cch chi thng thng: ngi i bc i cui cng l thng.

Cch chi misre: ngi i bc i cui cng l thua.

Trong sermina ny ch xt n cch chi thng thng.

1.4. Tnh cht ca mt Impartial game
Impartial game lun c kt thc l thng hay thua (win-or-lose outcome) (khng
c kt qu ha nh c tng hay c vua).
Mt Impartial game c th c xc nh bng mt tp cc v tr (postition) c th
c cho cc bc i.
Mt v tr c gi l P-position nu ti v tr ny ny tn ti mt chin thut
(strategy) ngi va i xong (Previous Player) thng. c bit nu v tr ny l

v tr khi u cho mt tr chi th y l mt P-position game (lc ny Previous

Player c ngha ngi i sau v c mt chin thut thng)
Mt v tr c gi l N-position nu tr chi ny tn ti mt chin thut (strategy)
ngi chun b i (Next Player) thng. c bit nu v tr ny l v tr khi u
cho mt tr chi th y l mt N-position game (lc ny Next Player c ngha
ngi i i trc v c mt chin thut thng)

Ta c tnh cht sau i vi N-position v P-position ca mt Impartial game

i.
ii.

iii.

iv.

V tr kt thc tr chi (terminal) phi l P-position.

Nu mt v tr c trng thi l P-position th mi v tr pht sinh
(followers) t n u c trng thi N-position (ngha l mi bc i
u dn n mt v tr N-position)
Nu mt v tr c trng thi l N-position th lun tn ti pht sinh
(flowers) t n c trng thi P-position (ngha l tn ti mt bc i
(strategy) n v tr P-postition).
Mt chin thut (strategy) thng l bc i t v tr N-position n
P- position.

V d: tr chi vi 4 vin si, subtraction set S={1,2,3}

1.5. Game tree:

Mt game tree l mt th c hng c node l cc v tr (position) trong game
v c cnh l cc bc i. Mt complete game tree l mt game tree c v tr bt
u v cha tt c cc bc i c th t mt v tr bt k.

Node l (Leaf Node) l mt terminal postition (P-position). S lng node l s

lng cc cch chi khc nhau.
V d: tr chi Caro:

V d: tr chi subtraction game vi tp rule S={1,2,3}

2. TNG CA NHNG GAME T HP (SUMS OF COMBINATORIAL

GAMES)
2.1. nh ngha
Hai game G v H c th tng hp li thnh mt tr chi mi gi l G+H trong
mt ngi chi c th chn mt bc i hoc trong G hoc trong H.
K hiu hnh thc: G+H = {G+h,

} {g+H,

V d: tr chi vi 2 ng si s lng ln lt l 3,4 c subtraction set l S={2,3}

2.2. Game tng ng

Hai game G v G l tng ng khi v ch khi vi mi game H th G+H v
G+H c cng kt qu (outcome class) ngha l cng l P-position hay cng NPostition. K hiu G G'.
D dng kim tra quan h ny l mt quan h tng ng.
Phn x: OK
i xng: OK
Bc cu:
GM

G+H cng outcome vi M+H

M G

M+H cng outcome vi G+H

Chon H = H: G+H cng outcome vi M+H cng outcome vi G+H

G G'
2.3. Cc tnh cht ca tng hai Impartial game
2.3.1. B 1
G l mt impartial games, G+G l mt P-position game.
Gii thch: ngi i sau lun bt chc ngi i trc nn ngi i sau
(Previuos Player) s i nc cui cng v dnh chin thng.
2.3.2. B 2
Nu G l impartial games bt k, A l mt P-position game th A+G G.
Chng minh:
Bai ton tng ng vi: chng minh G+H v A+G+H c cng outcome vi
mi game H.

Gi s G+H l mt P-position game, mi bc i ca Next Player trong G+H

th Previous Player u c mt strategy thng trong G+H v mi bc i
ca Next Player trong A th Previous Player u c mt strategy thng trong
A A+G+H cng l mt P-position game.
Gi s G+H l mt N-position game th Next Player s c strategy trong G+H
chuyn G+H thnh G+H l P-postion, lc tr chi tr thnh A+G+H
(trong G+H l mt P-position game) th y l 1 mt P-position game
(Previous Player thng, ngha l Next Player bc i trc thng) do
A+G+H l mt N-posttition game.
2.3.3. B 3
G v G l hai impartial games, G G' khi v ch khi G+G' l mt Pposition.
Chng minh:
1/ Thun ( G G'

G+G' l mt P-position):

Vi mi game H, G+H cng outcome vi G+H. Chn H bng G ta c G+G

cng outcome class vi G+G m theo nh l 1: G+G l P-position G+G
cng l P-position.
2/ Ngc (G+G' l mt P-position
G+H):

G G'

G+H cng outcome vi

G+G' l mt P-position nn theo nh l 2 th G+G+G G.

G+G cng l mt P-position nn G+G + G G

G G (quan h bc cu)

3. NH L SPRAGUE-GRUNDY
3.1. Hm Sprague-Grundy ca mt game tree
Gi X l tp hp cha tt c cc node ca mt game tree G. Gi F(x) l tp hp tt
c cc v tr pht sinh (followers) t x.
F chnh l mt hm s F : X X bin mt phn t x thuc X thnh mt tp con
ca X.
Nu F(x) rng th x dc gi la terminal position (trong game tree th x chnh l
node l, hay cng chnh l mt P-potition).

Xt v d sau:

F(0)={}
F(1)={0}
F(2)={0,1}

F(n) = {n-1, n-2, n-3}

t g: X N
g(x)=mex{g(y)| y

F(x)}

mex (minimal excludant) l gi tr khng m nh nht khng cha trong tp hp.

g(x) cn c gi l Grundy value ca x.
V d:

Cc tnh cht ca g(x):

i.
ii.
iii.

R rng g(x) c nh ngha mt cch quy.

Nu x l terminal th g(x)=0 do F(x) rng.
Nu x l khng phi l mt v tr terminal m mi pht sinh ca n l
terminal th g(x)=1.

Nu ta xem v tr x nh l mt tr chi (x l v tr bt u ca tr chi) v g(x) l

s si trong mt ng si ca tr chi NIM (one pile NIM) th x g(x) (
l
Impartial game th x+H cng outcome class vi g(x)+H). Mi impartial game th
tng ng vi mt tr chi NIM vi s si chnh l s Grundy ca n. Nn g(x)
cn c tn gi l nimber.
Chng minh x g(x): p dng B 3, ta s chng x+g(x) l mt P-position
game. t g(x)=m. (m chnh l s si trong tr chi NIM).
i. Gi s Next Player thc hin mt bc i trong x bin x thanh x c
g(x)=m.
TH1 m<m: Previous Player s thc hin mt bc i
trong m bin m thnh m. Ln lt nh vy th Previous
Player s nhn c vin si cui cng v chin thng.
TH2 m>m: Previous Player s thc hin mt bc i
trong x bin x thnh x c g(x)=m sao cho m<m
(quay li TH1 v chin thng).
ii. Tng t cho trng hp Next Player thc hin bc i trong m
trc.
Phn tch mi quan h gia g(x) vi P-position v N-position.
i.

Nu g(x) = 0 th x l P-position:
Gii thch:
Nu x l mt terminal position (P-position) th g(x) = 0
Ta c : g(x)=mex{g(y)| y F(x)}=0
Suy ra mi g(y) 0
Tng ng vi mi bc t v tr P-position u to ra
mt v tr N-position.

ii.

Nu g(x) 0 th x l N-position:
Gii thch:
Ta c : g(x)=mex{g(y)| y F(x)} 0
Suy ra c t nht mt v tr y pht sinh ca x sao cho g(y) = 0.
Tng ng vi tn ti mt bc i t v tr N-position n Pposition

3.2. Php ton XOR

XOR l ton t thao tc bit (cn gi l OR c loi tr - exclusive OR) cng l mt
ton t hai ngi, c nhim v thc hin tnh ton (trn tng bit) vi hai chui bit
c cng di to ra mt chui bit mi c cng di vi hai chui bit ban
u. Tuy nhin, trn mi cp bit tng ng nhau ca hai ton hng, ton t XOR
s tr v 1 nu ch c mt trong hai bit l 1 (v bit cn li l 0), ngc li, XOR tr
v bit 0.
V d:
0101
XOR 0011
-----0110
(cch nh d nht l: 2 bit ging nhau tr v 0, 2 bit khc nhau tr v 1) .
Tnh cht:
i.
ii.
iii.
iv.

a b=b a (giao hon)

(a b) c=a (b c) (kt hp)
b b=0
a 0=a (0 l phn t trung ha)

3.3. nh l Sprague-Grundy
t gi l mt hm Sprague-Grundy ca Gi, i = 1, . . . , n, th G = G1 +G2+ + Gn
c hm Sprague-Grundy g(x1, . . . , xn) = g1(x1) g1(x1)

gn(xn).
Chng minh: N/A
4. CC THUT TON VIT TRN C#:
Cc function sau ch p dng cho tr chi mt ng si:
4.1. Function tm mex:
private int mex(ArrayList SetF)
{
int tmp_max = max(SetF);
for (int i = 0; i < tmp_max; i++)
{
if (SetF.IndexOf(i) == -1) return i;
}
return tmp_max+1;
}

4.2. Function tm nhng v tr sau n, vi tp lut SetS

private ArrayList F(int n, ArrayList SetS)
{
int tmp_min = min(SetS);
ArrayList result= new ArrayList();
if (n < tmp_min)
{

result.Add(0);
return result;
}
foreach (int X in SetS)
{
if (n - X >= 0) result.Add(n - X);
}
result.Sort();
return result;
}

4.3. Function tnh g(x) ti v tr n vi tp lut SetS

private int Gx(int n, ArrayList SetS)
{
if(n<=0) return 0;
ArrayList Fx = F(n,SetS);
ArrayList MexFx = new ArrayList();
foreach(int y in Fx)
{
MexFx.Add(Gx(y,SetS));
}
return mex(MexFx);
}

4.4. So snh kt qu vi cng thc:

S={1,4}
fs(x) =0 1 0 1 1 0 1 0 1 1 0 1 0 1 1 0 1 0 1 1
g(x) =0 1 0 1 2 0 1 0 1 2 0 1 0 1 2 0 1 0 1 2
S={2,3}
fs(x) =0 1 1 1 0 0 1 1 1 0 0 1 1 1 0 0 1 1 1 0
g(x) =0 1 1 2 0 0 1 1 2 0 0 1 1 2 0 0 1 1 2 0
S={2,5}
fs(x) =0 1 1 0 0 1 1 0 1 1 0 0 1 1 0 1 1 0 0 1
g(x) =0 1 1 0 0 1 1 0 2 1 0 0 1 1 0 2 1 0 0 1
R rng l c s tng ng nu thay nhng s khc 0 ca g(x) bng 1

5. KT LUN
5.1. g(x) i vi tr chi subtraction game co dng nh th no?
Kho st tnh tun hon ca g(x) tng t nh fs(x).
5.2. Lp ma trn tr chi 2 ng si, tm kim s tun hon trn ?
T dng u tin v ct u tin, ta co th lp ma trn bng cch nh sau:
a/ Trn ng cho chnh, lun lun bng 0 (B 1)
b/ P-Postition game + P-Position game

P-Position game

c/ N-Postition game + P-Position game

N-Position game

d/ i vi nhng v tr N-Postition game + N-Position game p dng nh

l Sprague-Grundy

Tnh tun hon: ma trn c ph ln bi mt mu nh hnh bn di

6. TI LIU THAM KHO

[1]. Thomas S. Ferguson, Game Theory,
http://www.math.ucla.edu/~tom/Game_Theory/comb.pdf
[2]. Wikipedia, SpragueGrundy Theorem
http://en.wikipedia.org/wiki/Sprague%E2%80%93Grundy_theorem
[3]. Wolfram MathWord, Game Theory Topic,
http://mathworld.wolfram.com/topics/GameTheory.html