#include "game.h"

#include <boost/bind.hpp>

#include <iostream>
#include <algorithm>
#include <map>

#ifdef DEBUG
#include <ctime>
#endif

#include "../common/set.h"


Game::p Game::create(Client::p player_1, Client::p player_2, Client::p player_3, Client::p player_4) {
	Game::p p(new Game(player_1, player_2, player_3, player_4));
	p->start();
	return p;
}

Game::~Game() {
	std::cout << "Game destroyed." << std::endl;
}

Game::Game(Client::p player_1, Client::p player_2, Client::p player_3, Client::p player_4) {
	players[0].client = player_1;
	players[1].client = player_2;
	players[2].client = player_3;
	players[3].client = player_4;
}

void Game::handle_ready() {
	if(--awaiting_players) {
		return;
	}
	
	std::cout << "All ready!" << std::endl;
	
	round_start();
}

void Game::start() {
	std::cout << "Started a game with "
		<< players[0].client->nick() << ", "
		<< players[1].client->nick() << ", "
		<< players[2].client->nick() << " and "
		<< players[3].client->nick() << "." << std::endl;
	
	awaiting_players = 4;
	
	std::vector<std::string> pl;
	
	pl.push_back(players[0].client->nick());
	pl.push_back(players[1].client->nick());
	pl.push_back(players[2].client->nick());
	pl.push_back(players[3].client->nick());
	
	players[0].client->game_start(boost::bind(&Game::handle_ready, shared_from_this()), pl);
	players[1].client->game_start(boost::bind(&Game::handle_ready, shared_from_this()), pl);
	players[2].client->game_start(boost::bind(&Game::handle_ready, shared_from_this()), pl);
	players[3].client->game_start(boost::bind(&Game::handle_ready, shared_from_this()), pl);
}

void Game::round_start() {
	// Build a new wall.
	wall.build();
	
	// Notify players of round start.
	// TODO: Tell them where wall is broken.
	players[0].round_start();
	players[1].round_start();
	players[2].round_start();
	players[3].round_start();
	
	// Draw hands.
	for(int i = 0; i < 13; i++) {
		players[0].draw(wall.take_one());
		players[1].draw(wall.take_one());
		players[2].draw(wall.take_one());
		players[3].draw(wall.take_one());
	}
	
	// Sort hands.
	players[0].hand.sort();
	players[1].hand.sort();
	players[2].hand.sort();
	players[3].hand.sort();
	
	// Give east an extra tile.
	players[0].draw(wall.take_one());
	
	current_player = 0;
	
	round_update_draw();
}

void Game::round_update_draw() {
	// Get possible actions for current player.
	Actions possible_actions = players[current_player].get_actions_draw();
	
	// Construct and send state to each client.
	for(int i = 0; i < 4; i++) {
		State state;
		
		state.players[0] = players[i].get_state();
		state.players[1] = players[(i + 1) % 4].get_state_filtered();
		state.players[2] = players[(i + 2) % 4].get_state_filtered();
		state.players[3] = players[(i + 3) % 4].get_state_filtered();
		
		if(i == current_player) {
			state.possible_actions = possible_actions;
		}
		
		players[i].client->round_state(state);
	}
	
	// Await action from client.
	players[current_player].client->get_action(boost::bind(&Game::handle_action_draw, shared_from_this(), _1), possible_actions);
}

void Game::round_update_discard() {
	Tile discarded_tile = players[current_player].last_discard();
	
	std::map<int, Actions> possible_actions;
	
	// Construct and send state to each client.
	for(int i = 0; i < 4; i++) {
		State state;
		
		state.players[0] = players[i].get_state();
		state.players[1] = players[(i + 1) % 4].get_state_filtered();
		state.players[2] = players[(i + 2) % 4].get_state_filtered();
		state.players[3] = players[(i + 3) % 4].get_state_filtered();
		
		if(i != current_player) {
			Actions a = players[i].get_actions_discard(discarded_tile);
			if(a) {
				state.possible_actions = possible_actions[i] = a;
			}
		}
		
		players[i].client->round_state(state);
	}
	
	preceding_action = Action::Pass;
	if(possible_actions.empty()) {
		awaiting_players = 1;
		handle_action_discard(Action::Pass, 0);
	} else {
		awaiting_players = possible_actions.size();
		for(std::map<int, Actions>::iterator it = possible_actions.begin(); it != possible_actions.end(); it++) {
			players[it->first].client->get_action(boost::bind(&Game::handle_action_discard, shared_from_this(), _1, it->first), it->second);
		}
	}
}

void Game::handle_action_draw(Action action) {
	switch(action.type) {
		case Action::Discard: {
			players[current_player].discard(action.target);
			round_update_discard();
		} break;
		
		case Action::Riichi:
		case Action::Kan:
		case Action::Tsumo:
		case Action::Draw:
			// Not implemented yet.
		
		// Will never occur on draw:
		case Action::Pass:
		case Action::Chi:
		case Action::Pon:
		case Action::Ron:
			break;
	}
}

void Game::handle_action_discard(Action action, int player) {
	switch(preceding_action.type) {
		case Action::Pass:
		
		case Action::Chi:
			if(action.type == Action::Chi) {
				preceding_action = action;
				preceding_action_owner = player;
				break;
			}
		
		case Action::Kan:
			if(action.type == Action::Kan) {
				preceding_action = action;
				preceding_action_owner = player;
				break;
			}
		
		case Action::Pon:
			if(action.type == Action::Pon) {
				preceding_action = action;
				preceding_action_owner = player;
				break;
			}
		
		case Action::Ron:
			if(action.type == Action::Ron) {
				// TODO: Handle simultanous ron.
				preceding_action = action;
				preceding_action_owner = player;
				break;
			}
			break;
		
		// Will never occur on discard:
		case Action::Discard:
		case Action::Riichi:
		case Action::Tsumo:
		case Action::Draw:
			break;
	}
	
	if(--awaiting_players) {
		return;
	}
	
	switch(preceding_action.type) {
		case Action::Pass: {
			// Tile not claimed, next player draws.
			current_player = (current_player + 1) % 4;
			players[current_player].draw(wall.take_one());
			round_update_draw();
		} break;
		
		case Action::Chi:
		case Action::Kan:
		case Action::Pon:
		case Action::Ron:
			// Not implemented yet.
			std::cout << "Hei, morn, god dag!" << std::endl;
			break;
		
		// Will never occur on discard:
		case Action::Discard:
		case Action::Riichi:
		case Action::Tsumo:
		case Action::Draw:
			break;
	}
}

void Game::round_end() {
	// Flere runder? round_start()
	// Ferdig? game_end()
	players[0].client->round_end();
	players[1].client->round_end();
	players[2].client->round_end();
	players[3].client->round_end();
	
	#ifdef DEBUG
	
	time_t current_time = std::time(0);
	std::cout << std::ctime(&current_time) << " Round is over..." << std::endl;
	
	#endif
}

void Game::Player::round_start() {
	// Reset contents.
	hand.clear();
	open.clear();
	pond.clear();
	riichi = false;
	
	// Notify client of round start.
	client->round_start();
}

State::Player Game::Player::get_state() {
	State::Player state = {hand, open, pond};
	return state;
}

State::Player Game::Player::get_state_filtered() {
	State::Player state = {hand, open, pond};
	return state;
}

Actions Game::Player::get_actions_draw() {
	Actions possible_actions;
	
	// Check if player can force a draw.
	// Check if player can tsumo.
	// Check if player can declare a concealed kan or extend an open pon. List all possibilities.
	
	if(!riichi) {
		// Check if player can riichi.
		
		// List all tiles that can be discarded.
		for(std::size_t i = 0; i < hand.size(); i++) {
			possible_actions.push_back(Action(Action::Discard, i));
		}
	
	} else {
		// Only tile that can be discarded is the last drawn one.
		possible_actions.push_back(Action(Action::Discard, hand.size() - 1));
	}
	
	return possible_actions;
}

Actions Game::Player::get_actions_discard(Tile tile) {
	Actions possible_actions;
	
	if(!riichi) {
		// Check if tile can be called for a chi. Enumerate all combinations.
		Targets targets = can_chi(tile);
		if(!targets.empty()) {
			for(Targets::iterator it = targets.begin(); it != targets.end(); it++) {
				possible_actions.push_back(Action(Action::Chi, *it));
			}
		}
		
		// Check if tile can be called for a pon.
		int target = can_pon(tile);
		if(target > 0) {
			possible_actions.push_back(Action(Action::Pon, target));
			
			// Check if tile can be called for a kan.
			if(can_kan(tile, target)) {
				possible_actions.push_back(Action(Action::Kan, target));
			}
		}
	}
	
	// Check if tile can be ron-ed.
	
	// If any action is possible, add option to pass.
	if(possible_actions) {
		possible_actions.push_back(Action::Pass);
	}
	
	return possible_actions;
}

Game::Player::Targets Game::Player::can_chi(Tile tile) {
	Targets targets;
	
	Tile::Set set = tile.get_set();
	int num = tile.get_num();
	
	// Check if tile actually can be chi-ed.
	if(set == Tile::Honor) {
		return targets;
	}
	
	bool have_above = false;
	
	// Check if we have tile below.
	Tiles::iterator it = std::find(hand.begin(), hand.end(), Tile(set, num - 1));
	if(num > 1 && it != hand.end()) {
		
		// Check if we also have tile below tile below.
		Tiles::iterator it2 = std::find(hand.begin(), hand.end(), Tile(set, num - 2));
		if(num > 2 && it2 != hand.end()) {
			targets.push_back(it2 - hand.begin()); // (T-2 T-1 T)
		}
		
		// Check if we have tile above.
		it2 = std::find(hand.begin(), hand.end(), Tile(set, num + 1));
		if(num < 9 && it2 != hand.end()) {
			targets.push_back(it - hand.begin()); // (T-1 T T+1)
			have_above = true;
			it = it2;
		}
	}
	
	// Check if we have tile above.
	if(have_above || (it = std::find(hand.begin(), hand.end(), Tile(set, num + 1))) != hand.end()) {
		// Check if we have tile above tile above.
		Tiles::iterator it2 = std::find(hand.begin(), hand.end(), Tile(set, num + 2));
		if(num < 8 && it2 != hand.end()) {
			targets.push_back(it - hand.begin()); // (T T+1 T+2)
		}
	}
	
	return targets;
}

int Game::Player::can_pon(Tile tile) {
	Tiles::iterator it = std::find(hand.begin(), hand.end(), tile);
	if(it + 1 < hand.end() && it[1] == tile) {
		return it - hand.begin();
	}
	
	return -1;
}

//Game::Player::Targets Game::Player::can_kan() {
//	return Targets(); // TODO
//}

bool Game::Player::can_kan(Tile tile, int target) {
	if(std::size_t(target + 2) < hand.size() && hand[target + 2] == tile) {
		return true;
	}
	return false;
}

void Game::Player::draw(Tile tile) {
	hand.push_back(tile);
}

void Game::Player::discard(int target) {
	Tile tile = hand[target];
	hand.erase(hand.begin() + target);
	hand.sort();
	pond.push_back(tile);
}

Tile Game::Player::last_discard() {
	return pond.back();
}