Ejemplo n.º 1
0
        public GameTree <Object> makeGameTree(GameTree <Object> gt, IGame game)
        {
            List <Object> nextStates = new List <Object>();

            nextStates.AddRange(game.GetNextStates(gt.getData()));

            foreach (Object tmp in nextStates)
            {
                gt.AddChild(tmp);
            }


            foreach (GameTree <Object> x in gt)
            {
                List <Object> tmp = game.GetNextStates(x.getData());
                x.AddChildren(tmp);
                foreach (GameTree <Object> c in x)
                {
                    tmp = game.GetNextStates(c.getData());
                    c.AddChildren(tmp);
                }
            }


            return(gt);
        }
Ejemplo n.º 2
0
 private Object minimax(GameTree <Object> node, int depth, bool maximizingPlayer, IGame game)
 {
     if (depth == 0 || node.IsTerminal())
     {
         return(node.getData());
     }
     if (maximizingPlayer)
     {
         int    bestValue = -10000;
         Object bestState = (Object) new Object();
         foreach (GameTree <Object> item in node)
         {
             Object val = minimax(item, depth - 1, false, game);
             //bestValue = Math.Max(bestValue, game.Evaluate(val));
             int tmp = game.Evaluate(val);
             if (bestValue < tmp)
             {
                 bestValue = tmp;
                 bestState = item.getData();
             }
         }
         return(bestState);
     }
     else
     {
         int    bestValue = 10000;
         Object bestState = (Object) new Object();
         foreach (GameTree <Object> item in node)
         {
             Object val = minimax(item, depth - 1, true, game);
             //bestValue = Math.Min(bestValue, val);
             int tmp = game.Evaluate(val);
             if (bestValue > tmp)
             {
                 bestValue = tmp;
                 bestState = item.getData();
             }
         }
         return(bestState);
     }
 }
Ejemplo n.º 3
0
 private Object alphaBeta(GameTree <Object> node, int depth, int alpha, int beta, bool maximizingPlayer, IGame game)
 {
     if (depth == 0 || node.IsTerminal())
     {
         return(node.getData());
     }
     if (maximizingPlayer)
     {
         int    v         = -10000;
         Object bestState = (Object) new Object();
         foreach (GameTree <Object> child in node)
         {
             Object tmp = alphaBeta(child, depth - 1, alpha, beta, false, game);
             //v = Math.Max(game.Evaluate(bestState), game.Evaluate(tmp));
             int t = game.Evaluate(tmp);
             if (v < t)
             {
                 v         = t;
                 bestState = child.getData();
             }
             //alpha = Math.Max(alpha, v);
             if (alpha < v)
             {
                 alpha = v;
                 //bestState = child.getData();
             }
             if (beta < alpha)
             {
                 break;
             }
         }
         return(bestState);
     }
     else
     {
         int    v         = 1000;
         Object bestState = (Object) new Object();
         foreach (GameTree <Object> child in node)
         {
             Object tmp = alphaBeta(child, depth - 1, alpha, beta, false, game);
             int    t   = game.Evaluate(tmp);
             //v = Math.Min(v, alphaBeta(child, depth - 1, alpha, beta, true, game));
             if (v > t)
             {
                 v         = t;
                 bestState = child.getData();
             }
             //beta = Math.Min(beta, v);
             if (beta > v)
             {
                 beta = v;
                 //bestState = child.getData();
             }
             if (beta <= alpha)
             {
                 break;
             }
         }
         return(bestState);
     }
 }