public override void Update(GameTime gt)
{
if (map.moving) return;
rootNode = new DecisionNode(X, Y, PlayerTurn.Player2);
//rootNode.currState = ms;
Watch.Reset();
Watch.Start();
DecisionNode solution = null;
solution = DLSRoot(rootNode, -999999, 999999);
//if (Watch.ElapsedMilliseconds >= 500)
// break;
Watch.Stop();
if (solution == null && rootNode.GetChildren().Count > 0)
solution = rootNode.GetChildren()[0];
if (solution != null)
{
CardClass cc;
if (solution.cardStart.X < 0)
cc = hand.SelectCard((int)solution.cardStart.Y);
else
cc = map.map[(int)solution.cardStart.X, (int)solution.cardStart.Y];
map.MoveCard(cc, (int)solution.cardEnd.X, (int)solution.cardEnd.Y);
}
}
public AITurn(int maxX, int maxY, MapView mv)
: base(maxX, maxY)
{
X = maxX;
Y = maxY;
rootNode = new DecisionNode(maxX, maxY, PlayerTurn.Player2);
map = mv;
}
private int DLS(DecisionNode node, int depth, int alpha, int beta)
{
//if (Watch.ElapsedMilliseconds >= 500)
// return node.Value; // no more time
if (depth == maxDepth)
{
node.Value = NodeEval(map.map, node.pt, node.cardStart, node.cardEnd, depth);
return node.Value;
}
if (TestWin(node))
{
node.Value = NodeEval(map.map, node.pt, node.cardStart, node.cardEnd, depth);
return node.Value;
}
if (node.GetChildren().Count == 0)
{
ExpandNode(node, depth);
node.GetChildren().Sort(ChildNodeSort);
}
// Maximize!
CardClass movedCard;
if (node.GetChildren().Count == 0)
{
node.Value = NodeEval(map.map, node.pt, node.cardStart, node.cardEnd, depth);
return node.Value;
}
int value = 0;
foreach (DecisionNode n in node.GetChildren())
{
if (n.cardStart.X == -1)
{
Turn activeTurn = map.GetTurn(node.pt);
movedCard = activeTurn.SelectCard((int)n.cardStart.Y);
}
else
movedCard = map.map[(int)n.cardStart.X, (int)n.cardStart.Y];
map.MoveCardAI(movedCard, (int)n.cardEnd.X, (int)n.cardEnd.Y, depth);
value = -DLS(n, depth+1, -beta, -alpha);
map.UndoMove(movedCard);
if (value >= beta)
{
node.Value = beta;
return beta;
}
if (value > alpha)
alpha = value;
}
node.Value = alpha;
return alpha;
}
private int ChildNodeSort(DecisionNode n1, DecisionNode n2)
{
return n2.Value - n1.Value;
}
public void AddChild(DecisionNode dn)
{
children.Add(dn);
}
private bool TestWin(DecisionNode node)
{
// Check if there are no cards and no cards in hand.
if (map.map[0, 3] != null)
return true;
else if (map.map[6, 3] != null)
return true;
CardClass cc;
bool foundActive = false;
bool foundOther = false;
Turn activeTurn = map.GetTurn(node.pt);
Turn otherTurn = map.GetTurn(node.pt == PlayerTurn.Player1 ? PlayerTurn.Player2 : PlayerTurn.Player1);
for (int i = 0; i < map.map.GetLength(0); i++)
{
for (int j = 0; j < map.map.GetLength(1); j++)
{
cc = map.map[i, j];
if (cc != null && cc.GetCardType().player != node.pt)
{
foundActive = true;
}
else if (cc != null)
{
foundOther = true;
}
}
}
if (!foundActive && activeTurn.HandCount() == 0)
return true;
else if (!foundOther && otherTurn.HandCount() == 0)
return true;
else
return false;
}
private void ExpandNode(DecisionNode node, int depth)
{
CardClass s;
MoveLocation[,] moveMap;
// Add hand placements.
if (node.pt == this.turn)
{
for (int h = 0; h < hand.Count; h++)
{
for (int p = 1; p <= 5; p++)
{
if (map.map[1, p] == null)
{
DecisionNode dn = new DecisionNode(X, Y, (node.pt == PlayerTurn.Player1 ? PlayerTurn.Player2 : PlayerTurn.Player1));
dn.cardStart = new Vector2(-1, h);
dn.cardEnd = new Vector2(p, 1);
dn.moveI = 2;
dn.moveJ = 2;
//dn.Value = NodeEval(map.map, dn.pt, dn.cardStart, dn.cardEnd);
node.AddChild(dn);
}
}
}
}
if (map.deploy - depth > 0) return;
for (int i = 1; i < map.map.GetLength(0) - 1; i++)
{
for (int j = 1; j < map.map.GetLength(1) - 1; j++)
{
s = map.map[i, j];
if (s != null && s.GetCardType().player == node.pt)
{
moveMap = s.GetCardType().moves;
for (int mi = 0; mi < moveMap.GetLength(0); mi++)
{
for (int mj = 0; mj < moveMap.GetLength(1); mj++)
{
int newX = j + (mj -2);
int newY = i + (mi -2);
if (newX <= 0 || newX >= map.map.GetLength(0) - 1)
continue;
if (moveMap[mi, mj] != null && !(mi== 2 && mj == 2) && map.TestRecursiveCardMovement(s, new Vector2(j, i), s.GetMove()[mi, mj], s.GetMove(), mj, mi))
{
DecisionNode dn = new DecisionNode(X, Y, (node.pt == PlayerTurn.Player1 ? PlayerTurn.Player2 : PlayerTurn.Player1));
dn.cardStart = new Vector2(i, j);
dn.cardEnd = new Vector2(newX, newY);
dn.moveI = mi;
dn.moveJ = mj;
//dn.Value = NodeEval(map.map, dn.pt, dn.cardStart, dn.cardEnd);
node.AddChild(dn);
}
}
}
}
}
}
}
private DecisionNode DLSRoot(DecisionNode node, int alpha, int beta)
{
ExpandNode(node, 0);
// Maximize!
CardClass movedCard;
if (node.GetChildren().Count == 0)
{
node.Value = NodeEval(map.map, node.pt, node.cardStart, node.cardEnd, 0);
return null;
}
DecisionNode solution = null;
int value = 0;
foreach (DecisionNode n in node.GetChildren())
{
if (n.cardStart.X == -1)
{
Turn activeTurn = map.GetTurn(node.pt);
movedCard = activeTurn.SelectCard((int)n.cardStart.Y);
}
else
movedCard = map.map[(int)n.cardStart.X, (int)n.cardStart.Y];
map.MoveCardAI(movedCard, (int)n.cardEnd.X, (int)n.cardEnd.Y, 0);
value = -DLS(n, 1, -beta, -alpha);
map.UndoMove(movedCard);
if (value > alpha)
{
alpha = value;
solution = n;
}
}
node.Value = alpha;
return solution;
}