/
Node.cs
216 lines (199 loc) · 4.96 KB
/
Node.cs
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
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
using System.Windows;
namespace jm150635d
{
public class Node
{
private List<Node> children;
public Node Children
{
set
{
this.children.Add(value);
}
}
public List<Node> Childrens
{
get
{
return this.children;
}
}
private bool isMaxPlayer;
public bool IsMaxPlayer
{
get
{
return this.isMaxPlayer;
}
set
{
this.isMaxPlayer = value;
}
}
private double value;
public double Value
{
get
{
return this.value;
}
set
{
this.value = value;
}
}
private int row;
public int Row
{
get
{
return row;
}
set
{
row = value;
}
}
private int column;
public int Column
{
get
{
return column;
}
set
{
column = value;
}
}
private UIElement figure;
public UIElement Figure
{
get
{
return figure;
}
set
{
figure = value;
}
}
private int figureX;
public int FigureX
{
get
{
return figureX;
}
set
{
figureX = value;
}
}
private int figureY;
public int FigureY
{
get
{
return figureY;
}
set
{
figureY = value;
}
}
public Node getBestChildren()
{
Node bestChild = null;
double bestValue = 0;
if(isMaxPlayer == true)
{
bestValue = Player.MIN_VALUE;
for(int i = 0; i < children.Count; i++)
{
if(children[i].value > bestValue)
{
bestValue = children[i].value;
bestChild = children[i];
}
}
return bestChild;
}
else
{
bestValue = Player.MAX_VALUE;
for (int i = 0; i < children.Count; i++)
{
if (children[i].value < bestValue)
{
bestValue = children[i].value;
bestChild = children[i];
}
}
return bestChild;
}
return null;
}
/*
Same method as above, just used for hard comp
If there is possible field with 3 plots to move, take it and win the game
*/
public Node getBestChildren(GamePage gamePage)
{
Node bestChild = null;
double bestValue = 0;
if (isMaxPlayer == true)
{
bestValue = Player.MIN_VALUE;
for (int i = 0; i < children.Count; i++)
{
if(gamePage.fields[children[i].Row, children[i].Column] == 3)
{
bestChild = children[i];
break;
}
if (children[i].value > bestValue)
{
bestValue = children[i].value;
bestChild = children[i];
}
}
return bestChild;
}
else
{
bestValue = Player.MAX_VALUE;
for (int i = 0; i < children.Count; i++)
{
if (gamePage.fields[children[i].Row, children[i].Column] == 3)
{
bestChild = children[i];
break;
}
if (children[i].value < bestValue)
{
bestValue = children[i].value;
bestChild = children[i];
}
}
return bestChild;
}
return null;
}
public Node(int i, int j, bool isMax, UIElement figure, int x, int y)
{
isMaxPlayer = isMax;
row = i;
column = j;
children = new List<Node>();
this.figure = figure;
figureX = x;
figureY = y;
}
}
}