Minimax 算法是否按应有的方式实现了树？

Question

I want to create a minimax search which has a depth of 3, each node will have two childs, does the code properly represent that, is this the correct implementation, or am I doing something wrong?

    static int miniMaxAlgorithm(int node, int depth, bool maxPlayer)
    {
        int eval;
        int maxEval;
        int minEval;

        if (depth == 0)
        {            
             return node; // static evaluation to be returned          
        }

        if (maxPlayer)
        {

            maxEval = int.MaxValue;

            for (int i = 0; i < 2; i++)
            {
                eval = miniMaxAlgorithm(i, depth - 1, maxPlayer = false);
                maxEval = Math.Max(maxEval, eval);
                Console.WriteLine(maxEval);
                Console.WriteLine("{0}", depth);
            }
         
            return maxEval;
        }

        else
        {
            minEval = int.MinValue;

            for (int i = 0; i < 2; i++)
            {
                eval = miniMaxAlgorithm(i, depth - 1, maxPlayer = true);
                minEval = Math.Min(minEval, eval);
                Console.WriteLine(minEval);
                Console.WriteLine("{0}", depth);
            }
            return minEval;
        }

    }

Answer 1

It looks alright but unfinished to me. What are you planning to do with it? If you are playing a game for example then you want to make the move right before the

eval = miniMaxAlgorithm(i, depth - 1, maxPlayer = false);

And then undo the move right after that.

If you want to return the best move you also need to make some adjustments. But based on the pseudo code for Minimax found here the foundation of your implementation looks correct.

However, for easier readability, I would consider the Negamax function instead which might also make things easier down the road. Depending on what you plan to do with this.