ai.h

// Order and Chaos AI's.  - Tom Smeding

// The board is 6x6, in row-major order. Left-top is index 0.
// One player is Order, the other is Chaos; they take alternate turns, and can both place X'es and
// O's at will (one per turn). Order wins when five of the same stone are in a row (orthogonal or
// diagonal); Chaos wins when the board is full.
// There are no ties in this game.

#pragma once

#include <stdint.h>
#include <stdbool.h>

// Game board representation
typedef struct Board{
	uint64_t b[2];
} Board;

// Single move representation
typedef struct Move{
	int32_t pos,stone;
} Move;

// Players and stone types
#define ORDER 0
#define CHAOS 1
#define OO 0
#define XX 1

// Construct a Board
Board* makeboard(void);

// Apply the given move to the board (doesn't matter by whom)
void applymove(Board *board,Move mv);

// Test whether the specified position is empty
bool isempty(const Board *board,int pos);

// Print the board to stdout in a very simple format; useful for debugging
void printboard(const Board *board);

// Check whether someone has won on the board
// -1: nobody won yet; ORDER: Order has won; CHAOS: Chaos has won
int checkwin(const Board *board);

// Calculate a "good" move for the given player on the board (doesn't apply yet)
Move calcmove(Board *board,int player);