/*
 * Copyright (c) 2010 Daniel Hartmeier <daniel@benzedrine.ch>
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 *
 *    - Redistributions of source code must retain the above copyright
 *      notice, this list of conditions and the following disclaimer.
 *    - Redistributions in binary form must reproduce the above
 *      copyright notice, this list of conditions and the following
 *      disclaimer in the documentation and/or other materials provided
 *      with the distribution.
 *
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
 * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
 * COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
 * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
 * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
 * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
 * POSSIBILITY OF SUCH DAMAGE.
 *
 */

#ifndef __EXPAND_H__
#define __EXPAND_H__

#include <list>
#include <vector>

#include "board.h"

using namespace std;

class Node {
public:
	Node(const Board &b);
	Node(Node *p, DIR m, DIR o, unsigned long timeout);
	~Node();
	void isolation(unsigned long timeout);
	void rateIsolation(unsigned max, unsigned min, vector<DIR> &v,
	    unsigned long timeout);
	void spawn(unsigned long timeout);
	void push();
	int nearestWin(DIR &dir) const;
	int farthestDraw(DIR &dir) const;
	int bestUndecided(DIR &dir) const;
	int farthestLoss(DIR &dir) const;
	unsigned floodFill(bool op) const;

	Board board;
	Node *parent, *children[4][4];
	bool leaf, isolated;
	RESULT best;
	RESULT worst[4];
	int movesToWin;
	int movesToDraw;
	int movesToLoss;
	int area;
	vector<DIR> path;
private:
	list<Node *>::iterator i;
};

extern Node *root;
extern list<Node *> nodes;
extern unsigned long treesize;

#endif