/**/
/// <summary>
/// AlphaBeta剪枝法
/// </summary>
/// <returns></returns>
private int AlphaBetaSearch( int curDepth, int alpha, int beta)
... {
lock (this)
...{
if (curDepth >= Depth || times >= MaxTimes)
...
/// AlphaBeta剪枝法
/// </summary>
/// <returns></returns>
private int AlphaBetaSearch( int curDepth, int alpha, int beta)
... {
lock (this)
...{
if (curDepth >= Depth || times >= MaxTimes)
...