loops.c

// ============================
//
//    PROJECT MEGACHESSATRON
//
// ============================


/*
 * MIT License
 *
 * Copyright (c) 2017 Team Cos-Inifinity NITH
 *
 * Permission is hereby granted, free of charge, to any person obtaining a copy
 * of this software and associated documentation files (the "Software"), to deal
 * in the Software without restriction, including without limitation the rights
 * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
 * copies of the Software, and to permit persons to whom the Software is
 * furnished to do so, subject to the following conditions:
 *
 * The above copyright notice and this permission notice shall be included in all
 * copies or substantial portions of the Software.
 *
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
 * SOFTWARE.
 */

#include "common.h"

int expandnode(position** nodesList, move* movelist, position* initialPos){
	int i=0;
	move x=movelist[i];
	while(x.move){
		nodesList[i] = getPositionAfterMove(initialPos,x);
		i++;
		x = movelist[i];
	}
	nodesList[i] = NULL;
	return i;
}

position* findminormax(position* initialPos, position** nodesList){
	int i;
	position* best_position = nodesList[0];
	if(initialPos->turn=='w'){
		int max_eval = nodesList[0]->evaluation; // white should choose the position with max_eval
		for(i=0;nodesList[i]!=NULL;i++){
			if(max_eval<nodesList[i]->evaluation){
				max_eval = nodesList[i]->evaluation;
				best_position = nodesList[i];
			}
		}
	} else {
		int min_eval = nodesList[0]->evaluation; // black should go for min_eval
		for(i=0;nodesList[i]!=NULL;i++){
			if(min_eval>nodesList[i]->evaluation){
				min_eval = nodesList[i]->evaluation;
				best_position = nodesList[i];
			}
		}
	}
	return best_position;
}

void deleteAllNodes(position** nodesList){
	for(int i=0;nodesList[i]!=NULL;i++){
		deletePosition(nodesList[i]);
	}
}

position* evaluation_at_end(position* initialPos){
	int i = 0;
	switch(whoWon(initialPos)){
		case 1:
			i = 1000000;
			break;
		case -1:
			i = -1000000;
			break;
		case 0:
			i = 0;
			break;
	}
	position* ret = createNewPosition(initialPos->board);
	*ret = *initialPos;
	ret->evaluation = i;
	return ret;
}