ualberta.caisaac/math222/w13/lecture4_filled_in.pdf · lecture 4 definition 1: a strategy that...
TRANSCRIPT
![Page 1: ualberta.caisaac/math222/w13/lecture4_filled_in.pdf · Lecture 4 Definition 1: A strategy that enables a player to win no matter what move his or her opponent makes is called a winning](https://reader035.vdocuments.us/reader035/viewer/2022071015/5fce58c9b1b402457a04b1d0/html5/thumbnails/1.jpg)
![Page 2: ualberta.caisaac/math222/w13/lecture4_filled_in.pdf · Lecture 4 Definition 1: A strategy that enables a player to win no matter what move his or her opponent makes is called a winning](https://reader035.vdocuments.us/reader035/viewer/2022071015/5fce58c9b1b402457a04b1d0/html5/thumbnails/2.jpg)
![Page 3: ualberta.caisaac/math222/w13/lecture4_filled_in.pdf · Lecture 4 Definition 1: A strategy that enables a player to win no matter what move his or her opponent makes is called a winning](https://reader035.vdocuments.us/reader035/viewer/2022071015/5fce58c9b1b402457a04b1d0/html5/thumbnails/3.jpg)
![Page 4: ualberta.caisaac/math222/w13/lecture4_filled_in.pdf · Lecture 4 Definition 1: A strategy that enables a player to win no matter what move his or her opponent makes is called a winning](https://reader035.vdocuments.us/reader035/viewer/2022071015/5fce58c9b1b402457a04b1d0/html5/thumbnails/4.jpg)
Hint: Often drawing a full state diagram is impractical and unnecessary. A partial state diagram
(or a decision tree), if correctly drawn, can also indicate if the first player starts in a wining
position or not.
Ticktack Plus One
How to play: The game is played in the usual way tick-tack-toe is played but with a single cell
added. The first player to get 3 of their markers in a horizontal, vertical, or diagonal row wins
the game.
State the player that can always win and describe a winning strategy.
![Page 5: ualberta.caisaac/math222/w13/lecture4_filled_in.pdf · Lecture 4 Definition 1: A strategy that enables a player to win no matter what move his or her opponent makes is called a winning](https://reader035.vdocuments.us/reader035/viewer/2022071015/5fce58c9b1b402457a04b1d0/html5/thumbnails/5.jpg)
![Page 6: ualberta.caisaac/math222/w13/lecture4_filled_in.pdf · Lecture 4 Definition 1: A strategy that enables a player to win no matter what move his or her opponent makes is called a winning](https://reader035.vdocuments.us/reader035/viewer/2022071015/5fce58c9b1b402457a04b1d0/html5/thumbnails/6.jpg)
![Page 7: ualberta.caisaac/math222/w13/lecture4_filled_in.pdf · Lecture 4 Definition 1: A strategy that enables a player to win no matter what move his or her opponent makes is called a winning](https://reader035.vdocuments.us/reader035/viewer/2022071015/5fce58c9b1b402457a04b1d0/html5/thumbnails/7.jpg)
![Page 8: ualberta.caisaac/math222/w13/lecture4_filled_in.pdf · Lecture 4 Definition 1: A strategy that enables a player to win no matter what move his or her opponent makes is called a winning](https://reader035.vdocuments.us/reader035/viewer/2022071015/5fce58c9b1b402457a04b1d0/html5/thumbnails/8.jpg)
![Page 9: ualberta.caisaac/math222/w13/lecture4_filled_in.pdf · Lecture 4 Definition 1: A strategy that enables a player to win no matter what move his or her opponent makes is called a winning](https://reader035.vdocuments.us/reader035/viewer/2022071015/5fce58c9b1b402457a04b1d0/html5/thumbnails/9.jpg)
![Page 10: ualberta.caisaac/math222/w13/lecture4_filled_in.pdf · Lecture 4 Definition 1: A strategy that enables a player to win no matter what move his or her opponent makes is called a winning](https://reader035.vdocuments.us/reader035/viewer/2022071015/5fce58c9b1b402457a04b1d0/html5/thumbnails/10.jpg)
St-
/ piC\yer -A
A pI a.y s i, +he..... <:'en+er :
2ttJ pI ~y~r - B
CASt .i (S plo .. ys {n ct ccOr-,-,e..r)
(B)
(A)
A w;..-.s
CASE 2.. (B pl<.\ys in the. !'1~cld!e- o-F 11n e.d_..s,-~)
(B)
• ( B i s .f-or ceJ (A)
=#Jx I
(B)
I ·