fig10_67.cpp

经典书籍源代码啊。。。第三版。。。数据结构与算法分析——C++描述(第3版).

int TicTacToe::findHumanMove( int & bestMove )
{
    int i, responseValue;
    int dc;   // dc means don't care; its value is unused
    int value;

    if( fullBoard( ) )
        value = DRAW;
    else
    if( immediateHumanWin( bestMove ) )
        return COMP_LOSS;
    else
    {
        value = COMP_WIN; bestMove = 1;
        for( i = 1; i <= 9; i++ )  // Try each square
        {
            if( isEmpty( i ) )
            {
                place( i, HUMAN );
                responseValue = findCompMove( dc );
                unplace( i );  // Restore board

                if( responseValue < value )
                {
                      // Update best move
                    value = responseValue;
                    bestMove = i;
                }
            }
        }
    }
    return value;
}