oints = new point * [8]; (size_t i = 0; i <8; i + +)> points [i] = new
} :: ~ Tree ()
{(size_t i = 0; i
} * Tree :: insert_low (Tree * root, point ** points)
{* pTree = NULL; _t num = 0;> ai_Trees.resize (pTree-> num_moves (points)); (size_t i = 0; i <8; i + +)
{(size_t j = 0; j <8; j + +)
{(points [i] [j]. getT () == RED)
{((j +1) <8 && (i +1) <8)
{((points [i +1] [j +1]. getT () == EMPTYCELL | | [i +1] [j +1]. getT () == BLUE) & ; &
(root-> ai_Trees.size ()> num))
{= new
}
} ((j-1) <8 && (i +1) <8)
{((points [i +1] [j-1]. getT () == EMPTYCELL | | [i +1] [j-1]. getT () == BLUE) & ; &
(root-> ai_Trees.size ()> num))
{= new
}
}
} (points [i] [j]. getT () == REDKING && _king_ai (points, i, j))
{= new
}
}
} root;
} * Tree :: insert_mid (Tree * root, point ** points)
{* pTree = NULL; _t num = 0;> ai_Trees.resize (pTree-> num_moves_human (points)); (size_t i = 0; i <8; i + +)
{(size_t j = 0; j <8; j + +)
{(points [i] [j]. getT () == BLUE)
{((j-1)> 0 && (j-1) <8 && (i-1) <8 && (i-1)> 0)
{((points [i-1] [j-1]. getT () == EMPTYCELL | | [i-1] [j-1]. getT () == RED) & ; &
(root-> ai_Trees.size ()> num))
{= new
}
} ((j +1)> 0 && (j +1) <8 && (i-1) <8 && (i-1)> 0)
{((points [i-1] [j +1]. getT () == EMPTYCELL | | [i-1] [j +1]. getT () == RED) & ; &
(root-> ai_Trees.size ()> num))
{= new
}
}
} (points [i] [j]. getT () == BLUEKING && frag_king_ai (points, i, j))
{= new
}
}
} root;
} Tree :: print (Tree * root, size_t level)
{(root)
{(size_t i = 0; i ai_Trees.size (); i + +) (root-> ai_Trees [i], level +1); (size_t i = 0; i rang <
}
} Tree :: change_board (point ** board, point ** new_board)
{(size_t i = 0; i <8; i + +) (size_t j = 0; j <8; j + +) [i] [j] = new_board [i] [j];
} _t Tree :: num_moves_human (point **...
