How exactly does minimax recursion work?
===

So I was looking up Mini-max for a Tic-Tac-Toe Game, but couldn't understand how the recursion worked? Okay, so basically here are my questions:

 1. How does minimax know whose turn is it? Whats the best way to indicate the player whose turn it is generating?
 2. How do you generate possible moves?
 3. How do you know when you are at a terminal node, and how do you generate the terminal nodes?

For example in this Pseudo-code

    function integer minimax(node, depth)
    if node is a terminal node or depth <= 0:
        return the heuristic value of node
    α = -∞
    for child in node: # evaluation is identical for both players
        α = max(α, -minimax(child, depth-1))
    return α

A `node` is a board correct? And is the depth how many plies the code has to go down in recursion? Also what is the `max` function and where are the nodes being generated from?

Now, so far I have this code for creating a board:


    class Board{
	    public:
		    Board();
		    ~Board(){};
	    public: // The board
		    // In the board, 1 is x, 2 is o, 0 is empty square.
		    int board[3][3];
    };

But how would I know whose turn is it? And how do I generate the child nodes for the board?
