player.cpp

#include "player.h"

#include <iostream> 
#include <cassert>
#include <ctime>

Player::Player(const std::string &name,Token player) : name(name), player(player) {
	assert(not player==NOT_PLAYED);
}

Token Player::get_player() const {
	return player;
}

void Player::print() const {
	std::cout<<name<<" "<<player;
}

void PlayerBot::print() const {
    Player::print();
	std::cout<<" max_sec="<<max_sec<<" max_iteration="<<max_iteration<<" uct_constant="<<root->get_uct_constant();
}

PlayerBot::PlayerBot(Token player,double max_sec,int max_iteration,Value uct_constant) : Player("bot",player), max_sec(max_sec),max_iteration(max_iteration),root(new Node(uct_constant)) {}

Move *PlayerBot::get_move(const Board *board, const Move * last_move) {
    //std::cout<<"playing enemy move"<<std::endl;
    //root->print_tree();

    //reuse last simulations if possibles
	if (last_move) root=root->advance_and_detach(last_move);
    Count saved_simulations=root->get_nb();

    //std::cout<<"before simulations"<<std::endl;
    //root->print_tree();

	clock_t start=clock(),end=clock();
	int k;
    for (k=0; (k<max_iteration or not max_iteration) and root->get_mode()==NORMAL and end-start<max_sec*CLOCKS_PER_SEC; k++) {
        Board *copy=board->deepcopy();
        Token winner=root->play_random_game(copy,player);
        delete copy;

		end=clock();
    }

	const Node *best_child=root->get_best_child();
	if (not best_child) return nullptr;

    const Move *move=best_child->get_move();

	//debug report
    //std::cout<<"after simulations"<<std::endl;
    //root->print_tree();
    //root->print_best_branch_down();
    //std::cout<<std::endl;

	//simulation report
	std::cout<<"simulated "<<k<<" games ("<<saved_simulations<<" saved) in "<<float(end-start)/CLOCKS_PER_SEC<<"s"<<std::endl;

    //root->print_tree(0,2);

	//move report
    std::cout<<"playing ";
	switch (root->get_mode()) {
	case NORMAL:
		std::cout<<"normal "<<best_child->get_winning_probability()<<" ";
		break;
	case WINNER:
		std::cout<<"loosing ";
		break;
	case LOOSER:
		std::cout<<"winning ";
		break;
	}
	std::cout<<"move ";
    move->print();
    std::cout<<std::endl;

    //play best_move
	root=root->advance_and_detach(move);
    //std::cout<<"after playing best_move"<<std::endl;
    //root->print_tree();


	Move *copy=move->deepcopy();
	return copy;
}

PlayerBot::~PlayerBot() {
	delete root;
}

PlayerHuman::PlayerHuman(Token player) : Player("human",player) {}

Move *PlayerHuman::get_move(const Board *board,const Move * last_move) {
	Move *move= nullptr;

	while (not move) {

		std::cout<<"choose move: ";
		char string[MAX_INPUT_LENGTH];
		std::cin.getline(string,MAX_INPUT_LENGTH);

		if (not std::cin.good()) {
			std::cout<<std::endl;
			break;
		}

		move=board->parse_move_string(player,string);
	}

	//move report
	//if (not move) return NULL;
    //std::cout<<"playing move ";
    //move->print();
    //std::cout<<std::endl;

	return move;
}