-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathtest.tex
130 lines (119 loc) · 3.22 KB
/
test.tex
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
\documentclass{article}
\begin{enumerate}
\item
Draw a game tree for the first two moves (\texttt{A} moves
then \texttt{B} moves.
\marginpar{[10 pts]}
This tree should show the actual board setups!
\textbf{Solution:}
\begin{minipage}[t][5cm][t]{0.9\textwidth}
\begin{center}
\begin{tikzpicture}[scale=0.5]
\tikzstyle{vertex}=[rectangle, minimum width=60pt, minimum height=30pt, inner sep=2pt, draw=black]
% Root node
\node[vertex] (v0) at (0,0) {\underline{\texttt{A}}
\underline{\texttt{ }}
\underline{\texttt{ }}
\underline{\texttt{ }}
\underline{\texttt{ }}
\underline{\texttt{B}}};
% A's possible moves
\node[vertex] (v1) at (-6,-2) {\underline{\texttt{ }}
\underline{\texttt{A}}
\underline{\texttt{ }}
\underline{\texttt{ }}
\underline{\texttt{ }}
\underline{\texttt{B}}};
\node[vertex] (v2) at (0,-2) {\underline{\texttt{ }}
\underline{\texttt{ }}
\underline{\texttt{A}}
\underline{\texttt{ }}
\underline{\texttt{ }}
\underline{\texttt{B}}};
\node[vertex] (v3) at (6,-2) {\underline{\texttt{ }}
\underline{\texttt{ }}
\underline{\texttt{ }}
\underline{\texttt{A}}
\underline{\texttt{ }}
\underline{\texttt{B}}};
% B's possible moves from v1
\node[vertex] (v4) at (-9,-4) {\underline{\texttt{ }}
\underline{\texttt{A}}
\underline{\texttt{ }}
\underline{\texttt{ }}
\underline{\texttt{B}}
\underline{\texttt{ }}};
\node[vertex] (v5) at (-6,-4) {\underline{\texttt{ }}
\underline{\texttt{A}}
\underline{\texttt{ }}
\underline{\texttt{B}}
\underline{\texttt{ }}
\underline{\texttt{ }}};
\node[vertex] (v6) at (-3,-4) {\underline{\texttt{ }}
\underline{\texttt{A}}
\underline{\texttt{B}}
\underline{\texttt{ }}
\underline{\texttt{ }}
\underline{\texttt{ }}};
% B's possible moves from v2
\node[vertex] (v7) at (-3,-4) {\underline{\texttt{ }}
\underline{\texttt{ }}
\underline{\texttt{A}}
\underline{\texttt{ }}
\underline{\texttt{B}}
\underline{\texttt{ }}};
\node[vertex] (v8) at (0,-4) {\underline{\texttt{ }}
\underline{\texttt{ }}
\underline{\texttt{A}}
\underline{\texttt{B}}
\underline{\texttt{ }}
\underline{\texttt{ }}};
\node[vertex] (v9) at (3,-4) {\underline{\texttt{ }}
\underline{\texttt{ }}
\underline{\texttt{A}}
\underline{\texttt{ }}
\underline{\texttt{ }}
\underline{\texttt{B}}};
% B's possible moves from v3
\node[vertex] (v10) at (3,-4) {\underline{\texttt{ }}
\underline{\texttt{ }}
\underline{\texttt{ }}
\underline{\texttt{A}}
\underline{\texttt{ }}
\underline{\texttt{B}}};
\node[vertex] (v11) at (6,-4) {\underline{\texttt{ }}
\underline{\texttt{ }}
\underline{\texttt{ }}
\underline{\texttt{A}}
\underline{\texttt{B}}
\underline{\texttt{ }}};
\node[vertex] (v12) at (9,-4) {\underline{\texttt{ }}
\underline{\texttt{ }}
\underline{\texttt{ }}
\underline{\texttt{A}}
\underline{\texttt{ }}
\underline{\texttt{B}}};
% Connect nodes
\draw (v0) -- (v1);
\draw (v0) -- (v2);
\draw (v0) -- (v3);
\draw (v1) -- (v4);
\draw (v1) -- (v5);
\draw (v1) -- (v6);
\draw (v2) -- (v7);
\draw (v2) -- (v8);
\draw (v2) -- (v9);
\draw (v3) -- (v10);
\draw (v3) -- (v11);
\draw (v3) -- (v12);
\end{tikzpicture}
\end{center}
\end{minipage}
\item
Draw a second tree which contains the heuristic values for the leaves
\marginpar{[10 pts]}
and then fill in the remaining values according to the Minimax algorithm.
\textbf{Solution:}
\end{enumerate}
\end{enumerate}
\end{document}