Competition protocol in AI

1 files changed, 55 insertions, 1 deletions

diff --git a/main.cpp b/main.cpp
index d0934f4..ec4775a 100644
--- a/main.cpp
+++ b/main.cpp
@@ -1,11 +1,12 @@
 #include <iostream>
+#include <sstream>
 #include <cstdlib>
+#include <unistd.h>
 #include <sys/time.h>
 #include "board.h"
 #include "ai_mc.h"
 #include "ai_rand.h"
 #include "ui.h"
-#include "util.h"
 
 using namespace std;
 
@@ -17,6 +18,54 @@ using namespace std;
 #endif
 
 
+static uint8_t readPlace(Board &bd) {
+	string line;
+	getline(cin, line);
+	if (line.size() >= 1 && tolower(line[0]) == 'q') {
+		exit(0);
+	} else if (line.size() >= 6 && memcmp(line.data(), "place ", 6) == 0) {
+		istringstream ss(line.substr(6));
+		int x, y, clr;
+		ss >> x >> y >> clr;
+		return bd.putCW(BSZ * (y + BMID) + x + BMID, clr);
+	} else {
+		cerr << "Expected place line, got '" << line << "'" << endl;
+		exit(1);
+	}
+}
+
+static void protocolIO() {
+	Board bd = Board::makeEmpty();
+	readPlace(bd);
+
+	string line;
+
+	char c = cin.peek();
+	uint8_t myclr;
+	if (c == 's' || c == 'S') {
+		myclr = 1;
+		getline(cin, line);
+	} else if (c == 'q' || c == 'Q') {
+		return;
+	} else {
+		myclr = 2;
+	}
+
+	uint8_t onturn = 1;
+	while (true) {
+		if (onturn == myclr) {
+			int idx = AI::calcMove(bd, onturn);
+			int x = idx % BSZ - BMID, y = idx / BSZ - BMID;
+			cout << x << ' ' << y << endl;
+			readPlace(bd);
+		} else {
+			readPlace(bd);
+		}
+
+		onturn = NEXTTURN(onturn);
+	}
+}
+
 int main() {
 	struct timeval tv;
 	gettimeofday(&tv, nullptr);
@@ -24,6 +73,11 @@ int main() {
 
 	cerr << "Using AI " << STR(AI) << endl;
 
+	if (!isatty(STDOUT_FILENO)) {
+		protocolIO();
+		return 0;
+	}
+
 	Board bd = Board::makeEmpty();
 	// cerr << "Initial stone at " << Idx(BSZ * BMID + BMID) << endl;
 	bd.put(BSZ * BMID + BMID, bd.bag.drawRandom());