/*
 * Copyright (C)  2019~2020  偕臧  All rights reserved.
 *
 * Author:  xmuli(偕臧) xmulitech@gmail.com
 *
 * github:  https://github.com/xmuli
 * blogs:   https://xmuli.tech
 *
 * This program is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program.  If not, see <https://touwoyimuli.github.io/>.
 */
#ifndef MACHINEGAME_H
#define MACHINEGAME_H

#include "ChessBoard.h"
#include "ChessStep.h"
#include <QVector>

class MachineGame : public ChessBoard
{
public:
    MachineGame();
    ~MachineGame();

    void chooseOrMovePieces(int tempID, int& row, int& col); //辅助函： 选棋或移动棋子

    void saveStep(int moveID, int checkedID, int row, int col, QVector<ChessStep*>& steps);  //保存棋子步骤
    void getAllPossibleMoveStep(QVector<ChessStep*>& steps);  //获得所有可能的移动步骤(击杀)
    void getAllPossibleMoveStepAndNoKill(QVector<ChessStep*>& steps);  //获得所有可能的移动步骤(不击杀)

    virtual void mousePressEvent(QMouseEvent *);    //鼠标点击事件
    void clickPieces(int checkedID, int& row, int& col);

    void fakeMove(ChessStep* step);  //假装移动棋子
    void unFakeMove(ChessStep* step);  //撤回先前假装移动棋子的步骤
    int calcScore();  //计算最好的局面分
    ChessStep* getBestMove();   //获得最好的移动步骤

    void machineChooseAndMovePieces(); //机器 黑方时间: 进行选棋+下棋
};

#endif // MACHINEGAME_H