ki promotePieces

ki/heuristic.c

@@ -40,8 +40,25 @@ int heuristic_simple(const char playingField[8][8],const bool white){
 }
 
 
+void promotePieces(char playingField[8][8],const bool white){
+	const char youMen=white ? 'w' : 'b';
+	const char youQueen=white ? 'W' : 'B';
+	const int youFarthestRow= white ? 8 : 0;
+	for(int i=0;i<8;i++){
+		if(playingField[i][youFarthestRow]==youMen){
+			playingField[i][youFarthestRow]=youQueen;
+		}
+	}
+}
+
 //uses the loockup table that takes positions into account
-int heuristic_advanced(const char playingField[8][8],const bool white){
+int heuristic_advanced(char playingField[8][8],const bool white){
+	
+	//HACK
+	//we did not promote men to queens yet when this function is called
+	
+	promotePieces(playingField,white);
+	
 	const char youMen=white ? 'w' : 'b';
 	const char youQueen=white ? 'W' : 'B';
 	int score=0;

ki/heuristic.h

@@ -7,7 +7,7 @@
 
 int heuristic_simple(const char playingField[8][8],const bool white);
 
-int heuristic_advanced(const char playingField[8][8],const bool white);
+int heuristic_advanced(char playingField[8][8],const bool white);
 
 
 

ki/simpleKI.c

@@ -109,6 +109,7 @@ void random_selectMove(Table* now, char* moveCommandB){
 	}
 }
 
+
 //select the best jump / best step move possible,
 //based on the lookup table
 void weighted_selectMove(Table* now, char* moveCommandB){